DBSCAN Neighbourhood Calculator

Explore epsilon neighbourhoods, classify every point, compare DBSCAN settings, visualize clusters, inspect distances, and export clear results from your own dataset instantly with confidence.

Analysis Results

Results appear here after calculation.

Selected Point Summary

Choose data and calculate.

Point Classification

PointCoordinatesNeighboursStatusClusterNearest coreCore distance
No analysis yet.

Distance and Neighbourhood Table

SourceTargetCoordinatesDistanceInside εTarget statusCluster
No distance data yet.

Neighbourhood and Cluster Plot

k-Distance Plot

Neighbour Distance Distribution

Neighbour Count by Point

Parameter Sensitivity

Parameter Comparison

εMinPtsMetricClustersCoreBorderNoiseNoise %
Run comparison to populate this table.

Dataset Input

SelectLabelXYZ

DBSCAN Parameters

Parameter Comparison Settings

Formula Used

Nε(p) = { q ∈ D | d(p,q) ≤ ε } A point is core when its epsilon neighbourhood contains at least MinPts points. A border point is not core but lies inside a core point neighbourhood. A noise point is neither core nor border.

How to Use

  1. Enter points manually, paste rows, import CSV, or load an example.
  2. Choose epsilon, MinPts, distance metric, scaling, and feature weights.
  3. Select a reference point and calculate all DBSCAN neighbourhoods.
  4. Inspect classifications, distance tables, clusters, charts, and warnings.
  5. Compare parameter combinations and export reports or CSV files.

Example Data

PointXYExpected role
A11.01.2Likely core
A21.41.1Likely core or border
B15.25.0Likely core
N18.21.1Likely noise

Frequently Asked Questions

What does epsilon control?

Epsilon sets the maximum distance for neighbourhood membership.

What does MinPts control?

MinPts defines how many nearby points create a core point.

Should the point itself count?

DBSCAN commonly counts the point itself inside its neighbourhood.

Why do all points become noise?

Epsilon may be too small, or MinPts may be too large.

Why does one huge cluster appear?

Epsilon may be too large for the dataset scale.

Should data be scaled?

Scaling helps when features use very different numeric ranges.

What is a border point?

It is near a core point but lacks enough neighbours itself.

Can DBSCAN find irregular clusters?

Yes. Density connectivity supports curved and non-spherical cluster shapes.

How should epsilon be selected?

Inspect the k-distance curve and choose a meaningful elbow.

Related Calculators

K-Means Clustering CalculatorEuclidean Distance CalculatorManhattan Distance CalculatorCosine Similarity CalculatorSilhouette Score CalculatorDavies-Bouldin Index CalculatorCalinski-Harabasz Score CalculatorCluster Centroid CalculatorWithin-Cluster Sum of Squares CalculatorElbow Method Calculator

Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.