Core point
A core point is a DBSCAN observation whose specified-radius neighborhood contains at least the required minimum number of observations, including itself.
Advanced Algorithms and Data Structures
A core point in DBSCAN is a data point whose neighborhood contains at least the required number of dataset points within the specified radius.
- How it is used
- Uses core points to decide which DBSCAN points expand clusters and which nearby points merely join them.
- How deep it goes
- Defines the neighborhood threshold, develops the expansion rule, and relates its range-query implementation to conditional running-time bounds.
- Examples
- Illustrates a minPoints threshold of 3, a DBSCAN expansion loop, and border-point handling across adjacent shards.
- What you can do after
- Build it from scratch by counting ε-neighbors, expanding only from core points, and checking shard margins when distributing DBSCAN.
Read how Advanced Algorithms and Data Structures explains core point →
Data Without Labels
A core point is a DBSCAN observation having at least minPts points, including itself, within epsilon distance.
- How it is used
- Uses local point density to identify the building blocks of DBSCAN clusters.
- How deep it goes
- Defines the ε and minPts test and links it to density, but does not detail the full clustering procedure.
- Examples
- Illustrates core points with Figure 2.29 and DBSCAN configurations using alternative eps and min_samples values.
- What you can do after
- Evaluate whether observations satisfy a DBSCAN neighborhood density threshold.
What to know first
- clusteringClustering is the process of grouping data items so that items within a group are more similar to one another than to items in other groups.
- K-means clusteringK-means clustering is an algorithm that partitions data into a specified number of clusters by iteratively assigning observations to the nearest centroid and updating each centroid to the mean of its assigned observations.
Related concepts
- DBSCANused by · DBSCAN is a density-based clustering algorithm that groups observations in dense regions and identifies observations in lower-density regions as noise or outliers.
- pointkind of · A point is a zero-dimensional location in a geometric or coordinate space, commonly represented by an ordered set of coordinate values.
Questions about core point
What is core point?
A core point is a DBSCAN observation whose specified-radius neighborhood contains at least the required minimum number of observations, including itself.
Which Manning books explain core point?
Advanced Algorithms and Data Structures and Data Without Labels.
What should I know before learning core point?
Manning books that teach core point usually introduce clustering and K-means clustering first.
What is core point a kind of?
Core point is a kind of point. A point is a zero-dimensional location in a geometric or coordinate space, commonly represented by an ordered set of coordinate values.
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.

