Connecting the Dots -- Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering-Reference-Cited by-同舟云学术

Connecting the Dots -- Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Beer Anna¹^ORCID,Draganov Andrew¹^ORCID,Hohma Ellen²^ORCID,Jahn Philipp³^ORCID,Frey Christian M.M.⁴^ORCID,Assent Ira⁵^ORCID

Affiliation:

1. Aarhus University, Aarhus, Denmark

2. Technical University of Munich, Munich, Germany

3. LMU Munich, DBS, MCML, Munich, Germany

4. Fraunhofer IIS, Erlangen, Germany

5. Aarhus University, Aarhu, Denmark

Funder

Villum Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580305.3599283

Reference65 articles.

1. Exact and Approximation Algorithms for Clustering

2. OPTICS

3. Sivaraman Balakrishnan , Min Xu , Akshay Krishnamurthy , and Aarti Singh . 2011 . Noise thresholds for spectral clustering . Advances in Neural Information Processing Systems , Vol. 24 (2011). Sivaraman Balakrishnan, Min Xu, Akshay Krishnamurthy, and Aarti Singh. 2011. Noise thresholds for spectral clustering. Advances in Neural Information Processing Systems, Vol. 24 (2011).

4. Density-based clustering using graphics processors

5. LOF;Breunig Markus M.;Identifying Density-Based Local Outliers. SIGMOD Rec.,2000

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simple rapid sample-based clustering for large-scale data;Engineering Applications of Artificial Intelligence;2024-07

2. Medoid Silhouette clustering with automatic cluster number selection;Information Systems;2024-02

3. Data with Density-Based Clusters: A Generator for Systematic Evaluation of Clustering Algorithms;Lecture Notes in Computer Science;2024