liveBook · Manning

Determinism

As explained in Advanced Algorithms and Data Structures

A deterministic algorithm produces the same processing sequence and results for the same input and starting conditions, apart from unspecified tie handling.

Determinism means that fixed input and starting conditions reproduce the same processing sequence and result, except where tie handling is unspecified. DBSCAN is treated as deterministic because traversal order has little influence; OPTICS produces identical results when runs start from the same point, apart from possible reachability-distance ties. section 12.3 section 12.4.3

Repeatability matters differently across algorithms:

  • For DBSCAN, matching the point order guarantees the same result; its point traversal has less influence than k-means’ random initialization. section 12.3
  • For difficult optimization problems such as crossing-number analysis, heuristics may relax deterministic guarantees to find a sub-optimal answer in reasonable time. section 16.1

How Advanced Algorithms and Data Structures covers it

How deep it goes
Defines repeatability through processing order or starting point, while allowing unspecified ties in OPTICS reachability distances.
Examples
Compares DBSCAN point traversal and OPTICS runs from the same starting point with randomized heuristic search for crossing number.
What you can do after
Evaluate/understand whether repeated runs should match by checking processing order, starting point, and tie handling.
How it connects
Connects determinism to DBSCAN, OPTICS, k-means initialization, randomized algorithms, heuristics, and NP-hard optimization.

Also explained in

Compare how 10 books explain determinism →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.