Reachability
Reachability in DBSCAN is the relation by which points are connected through a sequence of core-point neighborhood relationships satisfying a distance condition.
Data Without Labels
Density reachability is the DBSCAN property by which points are connected through a sequence of core-point neighborhood relationships.
- How it is used
- Defines how DBSCAN forms connected clusters from core-point neighborhoods.
- How deep it goes
- Explains direct reachability, core-point directionality, and multi-step connectivity, but stops short of a full formal derivation.
- Examples
- Uses X, Y, and Z to demonstrate a multi-step path beyond one immediate neighborhood.
- What you can do after
- Understand DBSCAN connectivity by tracing core-point paths and interpreting reachable noncore points.
Advanced Algorithms and Data Structures
A density-reachable point is a point connected to another point through a chain of core points satisfying the neighborhood-radius condition.
- How it is used
- Defines how DBSCAN grows clusters through dense neighborhoods and separates unreachable points as noise.
- How deep it goes
- Develops core, direct-reachability, chained reachability, and edge-point assignment, then connects them to cluster expansion.
- Examples
- Uses points p, q, w, and v to illustrate chains, ambiguous edge assignments, and non-expanding non-core points.
- What you can do after
- Apply it via DBSCAN to expand density-based clusters, assign reachable points, and mark unreachable points as noise.
Read how Advanced Algorithms and Data Structures explains reachability →
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.