atlas

Research map / Graph learning / Graph algorithms and clustering

Faster DBSCAN via subsampled similarity queries

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Subsample the epsilon-neighborhood graph instead of constructing the full graphDBSCAN · Australianruntime: over 200x speedupHelped
Subsample the epsilon-neighborhood graph instead of constructing the full graphDBSCAN · StillRAM usage: over 250x reduction in RAMHelped
Subsample neighborhood edges while retaining all data pointsDBSCAN · Large datasetsARINo clear effect
Subsample neighborhood edges while retaining all data pointsDBSCAN · Large datasetsruntimeMixed
Use SNG-DBSCAN rather than DBSCAN++ with the same sampling rateDBSCAN++ · Large datasetsclustering metrics: 70% of the metricsMixed
Use a smaller edge sampling rate (ablation)SNG-DBSCAN · Simulated uniform ballsARIHelped
Vary the edge sampling rate (ablation)SNG-DBSCAN · Smaller datasetsclustering qualityNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy