{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T18:34:30Z","timestamp":1776278070154,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Villum Foundation","award":["34326"],"award-info":[{"award-number":["34326"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599283","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"80-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Connecting the Dots -- Density-Connectivity Distance unifies DBSCAN, k-Center and Spectral Clustering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6890-997X","authenticated-orcid":false,"given":"Anna","family":"Beer","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1617-4166","authenticated-orcid":false,"given":"Andrew","family":"Draganov","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5235-6856","authenticated-orcid":false,"given":"Ellen","family":"Hohma","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0059-9183","authenticated-orcid":false,"given":"Philipp","family":"Jahn","sequence":"additional","affiliation":[{"name":"LMU Munich, DBS, MCML, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2458-6651","authenticated-orcid":false,"given":"Christian M.M.","family":"Frey","sequence":"additional","affiliation":[{"name":"Fraunhofer IIS, Erlangen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1091-9948","authenticated-orcid":false,"given":"Ira","family":"Assent","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhu, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_3_2_2_3_1","volume-title":"Advances in Neural Information Processing Systems","volume":"24","author":"Balakrishnan Sivaraman","year":"2011","unstructured":"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)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646038"},{"key":"e_1_3_2_2_5_1","first-page":"2","article-title":"LOF","volume":"29","author":"Breunig Markus M.","year":"2000","unstructured":"Markus M. Breunig , Hans-Peter Kriegel , Raymond T. Ng , and J\u00f6rg Sander . 2000 . LOF : Identifying Density-Based Local Outliers. SIGMOD Rec. , Vol. 29 , 2 (may 2000), 93--104. https:\/\/doi.org\/10.1145\/335191.335388 10.1145\/335191.335388 Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, and J\u00f6rg Sander. 2000. LOF: Identifying Density-Based Local Outliers. SIGMOD Rec., Vol. 29, 2 (may 2000), 93--104. https:\/\/doi.org\/10.1145\/335191.335388","journal-title":"Identifying Density-Based Local Outliers. SIGMOD Rec."},{"key":"e_1_3_2_2_6_1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Campello Ricardo J. G. B.","unstructured":"Ricardo J. G. B. Campello , Davoud Moulavi , and Joerg Sander . 2013. Density-Based Clustering Based on Hierarchical Density Estimates . In Advances in Knowledge Discovery and Data Mining , Jian Pei, Vincent S. Tseng, Longbing Cao, Hiroshi Motoda, and Guandong Xu (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 160--172. https:\/\/doi.org\/10.1007\/978--3--642--37456--2_14 10.1007\/978--3--642--37456--2_14 Ricardo J. G. B. Campello, Davoud Moulavi, and Joerg Sander. 2013. Density-Based Clustering Based on Hierarchical Density Estimates. In Advances in Knowledge Discovery and Data Mining, Jian Pei, Vincent S. Tseng, Longbing Cao, Hiroshi Motoda, and Guandong Xu (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 160--172. https:\/\/doi.org\/10.1007\/978--3--642--37456--2_14"},{"key":"e_1_3_2_2_7_1","volume-title":"Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data","author":"Campello Ricardo J. G. B.","year":"2015","unstructured":"Ricardo J. G. B. Campello , Davoud Moulavi , Arthur Zimek , and J\u00f6rg Sander . 2015. Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data , Vol. 10 , 1 ( July 2015 ), 1--51. https:\/\/doi.org\/10.1145\/2733381 10.1145\/2733381 Ricardo J. G. B. Campello, Davoud Moulavi, Arthur Zimek, and J\u00f6rg Sander. 2015. Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data, Vol. 10, 1 (July 2015), 1--51. https:\/\/doi.org\/10.1145\/2733381"},{"key":"#cr-split#-e_1_3_2_2_8_1.1","doi-asserted-by":"crossref","unstructured":"J. Douglas Carroll and Phipps Arabie. 1998. Chapter 3 - Multidimensional Scaling. In Measurement Judgment and Decision Making Michael H. Birnbaum (Ed.). Academic Press San Diego 179--250. https:\/\/doi.org\/10.1016\/B978-012099975-0.50005--1 10.1016\/B978-012099975-0.50005--1","DOI":"10.1016\/B978-012099975-0.50005-1"},{"key":"#cr-split#-e_1_3_2_2_8_1.2","doi-asserted-by":"crossref","unstructured":"J. Douglas Carroll and Phipps Arabie. 1998. Chapter 3 - Multidimensional Scaling. In Measurement Judgment and Decision Making Michael H. Birnbaum (Ed.). Academic Press San Diego 179--250. https:\/\/doi.org\/10.1016\/B978-012099975-0.50005--1","DOI":"10.1016\/B978-012099975-0.50005-1"},{"key":"e_1_3_2_2_9_1","volume-title":"A unified view of density-based methods for semi-supervised clustering and classification. Data mining and knowledge discovery","author":"Gertrudes Jadson Castro","year":"2019","unstructured":"Jadson Castro Gertrudes , Arthur Zimek , J\u00f6rg Sander , and Ricardo JGB Campello . 2019. A unified view of density-based methods for semi-supervised clustering and classification. Data mining and knowledge discovery , Vol. 33 ( 2019 ), 1894--1952. Jadson Castro Gertrudes, Arthur Zimek, J\u00f6rg Sander, and Ricardo JGB Campello. 2019. A unified view of density-based methods for semi-supervised clustering and classification. Data mining and knowledge discovery , Vol. 33 (2019), 1894--1952."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-020-00980-7"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.04.010"},{"key":"e_1_3_2_2_12_1","volume-title":"Rates of convergence for the cluster tree. Advances in neural information processing systems","author":"Chaudhuri Kamalika","year":"2010","unstructured":"Kamalika Chaudhuri and Sanjoy Dasgupta . 2010. Rates of convergence for the cluster tree. Advances in neural information processing systems , Vol. 23 ( 2010 ). Kamalika Chaudhuri and Sanjoy Dasgupta. 2010. Rates of convergence for the cluster tree. Advances in neural information processing systems, Vol. 23 (2010)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10799"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.95"},{"key":"e_1_3_2_2_15_1","volume-title":"DBSCAN Is Semi-Spectral Clustering. In 2020 6th International Conference on Big Data and Information Analytics (BigDIA). IEEE, 257--264","author":"Chen Yewang","year":"2020","unstructured":"Yewang Chen . 2020 . DBSCAN Is Semi-Spectral Clustering. In 2020 6th International Conference on Big Data and Information Analytics (BigDIA). IEEE, 257--264 . https:\/\/doi.org\/10.1109\/BigDIA51454.2020.00048 10.1109\/BigDIA51454.2020.00048 Yewang Chen. 2020. DBSCAN Is Semi-Spectral Clustering. In 2020 6th International Conference on Big Data and Information Analytics (BigDIA). IEEE, 257--264. https:\/\/doi.org\/10.1109\/BigDIA51454.2020.00048"},{"key":"e_1_3_2_2_16_1","first-page":"10","volume-title":"ACM","volume":"66","author":"Vincent","year":"2019","unstructured":"Vincent Cohen-addad, Varun Kanade , Frederik Mallmann-trenn, and Claire Mathieu . 2019 . Hierarchical Clustering: Objective Functions and Algorithms. J . ACM , Vol. 66 , 4, Article 26 (jun 2019), 42 pages. https:\/\/doi.org\/ 10 .1145\/3321386 10.1145\/3321386 Vincent Cohen-addad, Varun Kanade, Frederik Mallmann-trenn, and Claire Mathieu. 2019. Hierarchical Clustering: Objective Functions and Algorithms. J. ACM, Vol. 66, 4, Article 26 (jun 2019), 42 pages. https:\/\/doi.org\/10.1145\/3321386"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90216-0"},{"key":"e_1_3_2_2_18_1","volume-title":"L\u00f3pez","author":"Diaz-Chito Katerine","year":"2016","unstructured":"Katerine Diaz-Chito , Aura Hern\u00e1ndez-Sabat\u00e9 , and Antonio M . L\u00f3pez . 2016 . A Reduced Feature Set for Driver Head Pose Estimation. , Vol. 45 , C ( 2016). https:\/\/doi.org\/10.1016\/j.asoc.2016.04.027 10.1016\/j.asoc.2016.04.027 Katerine Diaz-Chito, Aura Hern\u00e1ndez-Sabat\u00e9, and Antonio M. L\u00f3pez. 2016. A Reduced Feature Set for Driver Head Pose Estimation. , Vol. 45, C (2016). https:\/\/doi.org\/10.1016\/j.asoc.2016.04.027"},{"key":"#cr-split#-e_1_3_2_2_19_1.1","unstructured":"Lukas Drexler Jan Eube Kelin Luo Heiko R\u00f6glin Melanie Schmidt and Julian Wargalla. 2022. Connected k-Center and k-Diameter Clustering. https:\/\/doi.org\/10.48550\/ARXIV.2211.02176 10.48550\/ARXIV.2211.02176"},{"key":"#cr-split#-e_1_3_2_2_19_1.2","unstructured":"Lukas Drexler Jan Eube Kelin Luo Heiko R\u00f6glin Melanie Schmidt and Julian Wargalla. 2022. Connected k-Center and k-Diameter Clustering. https:\/\/doi.org\/10.48550\/ARXIV.2211.02176"},{"key":"e_1_3_2_2_20_1","volume-title":"A local-density based spatial clustering algorithm with noise. Information systems","author":"Duan Lian","year":"2007","unstructured":"Lian Duan , Lida Xu , Feng Guo , Jun Lee , and Baopin Yan . 2007. A local-density based spatial clustering algorithm with noise. Information systems , Vol. 32 , 7 ( 2007 ), 978--986. https:\/\/doi.org\/10.1016\/j.is.2006.10.006 10.1016\/j.is.2006.10.006 Lian Duan, Lida Xu, Feng Guo, Jun Lee, and Baopin Yan. 2007. A local-density based spatial clustering algorithm with noise. Information systems, Vol. 32, 7 (2007), 978--986. https:\/\/doi.org\/10.1016\/j.is.2006.10.006"},{"key":"e_1_3_2_2_21_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu etal 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In kdd Vol. 96. 226--231.  Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In kdd Vol. 96. 226--231."},{"key":"e_1_3_2_2_22_1","volume-title":"Clustering with the connectivity kernel. Advances in neural information processing systems","author":"Fischer Bernd","year":"2003","unstructured":"Bernd Fischer , Volker Roth , and Joachim Buhmann . 2003. Clustering with the connectivity kernel. Advances in neural information processing systems , Vol. 16 ( 2003 ). Bernd Fischer, Volker Roth, and Joachim Buhmann. 2003. Clustering with the connectivity kernel. Advances in neural information processing systems, Vol. 16 (2003)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90031-4"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737792"},{"key":"e_1_3_2_2_25_1","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume":"5","author":"Goldberg Andrew V","year":"2005","unstructured":"Andrew V Goldberg and Chris Harrelson . 2005 . Computing the shortest path: A search meets graph theory .. In SODA , Vol. 5. 156 -- 165 . Andrew V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory.. In SODA, Vol. 5. 156--165.","journal-title":"SODA"},{"key":"e_1_3_2_2_26_1","first-page":"11","article-title":"Unsupervised representation learning with Minimax distance measures","volume":"109","author":"Chehreghani Morteza Haghir","year":"2020","unstructured":"Morteza Haghir Chehreghani . 2020 . Unsupervised representation learning with Minimax distance measures . Machine Learning , Vol. 109 , 11 (Nov. 2020), 2063--2097. https:\/\/doi.org\/10.1007\/s10994-020-05886--4 10.1007\/s10994-020-05886--4 Morteza Haghir Chehreghani. 2020. Unsupervised representation learning with Minimax distance measures. Machine Learning, Vol. 109, 11 (Nov. 2020), 2063--2097. https:\/\/doi.org\/10.1007\/s10994-020-05886--4","journal-title":"Machine Learning"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031416"},{"key":"e_1_3_2_2_28_1","volume-title":"Clustering algorithms","author":"Hartigan John A","unstructured":"John A Hartigan . 1975. Clustering algorithms . John Wiley & Sons, Inc. John A Hartigan. 1975. Clustering algorithms. John Wiley & Sons, Inc."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013788"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_3_2_2_31_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"3029","author":"Jang Jennifer","year":"2019","unstructured":"Jennifer Jang and Heinrich Jiang . 2019 . DBSCAN: Towards fast and scalable density clustering . In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research , Vol. 97), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 3019-- 3029 . https:\/\/proceedings.mlr.press\/v97\/jang19a.html Jennifer Jang and Heinrich Jiang. 2019. DBSCAN: Towards fast and scalable density clustering. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 97), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 3019--3029. https:\/\/proceedings.mlr.press\/v97\/jang19a.html"},{"key":"e_1_3_2_2_32_1","volume-title":"On the bottleneck shortest path problem. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik","author":"Kaibel Volker","year":"2006","unstructured":"Volker Kaibel and Matthias Peinhardt . 2006. On the bottleneck shortest path problem. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik ( 2006 ). Volker Kaibel and Matthias Peinhardt. 2006. On the bottleneck shortest path problem. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik (2006)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8588"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.30"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2021.101922"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.3390\/rs12071162"},{"key":"e_1_3_2_2_37_1","volume-title":"Systematic Biology","volume":"65","author":"Lewitus Eric","year":"2015","unstructured":"Eric Lewitus and Helene Morlon . 2015 . Characterizing and Comparing Phylogenies from their Laplacian Spectrum . Systematic Biology , Vol. 65 , 3 (12 2015), 495--507. https:\/\/doi.org\/10.1093\/sysbio\/syv116 10.1093\/sysbio Eric Lewitus and Helene Morlon. 2015. Characterizing and Comparing Phylogenies from their Laplacian Spectrum. Systematic Biology, Vol. 65, 3 (12 2015), 495--507. https:\/\/doi.org\/10.1093\/sysbio\/syv116"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.010"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1386657"},{"key":"e_1_3_2_2_40_1","article-title":"Path-based spectral clustering: Guarantees, robustness to outliers, and fast algorithms","volume":"21","author":"Little Anna V","year":"2020","unstructured":"Anna V Little , Mauro Maggioni , and James M Murphy . 2020 . Path-based spectral clustering: Guarantees, robustness to outliers, and fast algorithms . Journal of machine learning research , Vol. 21 (2020). Anna V Little, Mauro Maggioni, and James M Murphy. 2020. Path-based spectral clustering: Guarantees, robustness to outliers, and fast algorithms. Journal of machine learning research , Vol. 21 (2020).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.08.012"},{"key":"#cr-split#-e_1_3_2_2_42_1.1","doi-asserted-by":"crossref","unstructured":"D. D. Lozovanu and V. A. Trubin. 1994. On the minimax path in a network. Vol. 4 5 (1994) 447--454. https:\/\/doi.org\/10.1515\/dma.1994.4.5.447 10.1515\/dma.1994.4.5.447","DOI":"10.1016\/0167-739X(94)90010-8"},{"key":"#cr-split#-e_1_3_2_2_42_1.2","doi-asserted-by":"crossref","unstructured":"D. D. Lozovanu and V. A. Trubin. 1994. On the minimax path in a network. Vol. 4 5 (1994) 447--454. https:\/\/doi.org\/10.1515\/dma.1994.4.5.447","DOI":"10.1515\/dma.1994.4.5.447"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939750"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-018-9266-x"},{"key":"e_1_3_2_2_45_1","volume-title":"Housworth","author":"Martins Em\u00edlia P.","year":"2002","unstructured":"Em\u00edlia P. Martins and Elizabeth A . Housworth . 2002 . Phylogeny Shape and the Phylogenetic Comparative Method. Systematic Biology , Vol. 51 , 6 (12 2002), 873--880. https:\/\/doi.org\/10.1080\/10635150290102573 10.1080\/10635150290102573 Em\u00edlia P. Martins and Elizabeth A. Housworth. 2002. Phylogeny Shape and the Phylogenetic Comparative Method. Systematic Biology, Vol. 51, 6 (12 2002), 873--880. https:\/\/doi.org\/10.1080\/10635150290102573"},{"key":"e_1_3_2_2_46_1","volume-title":"Knowledge and Systems Engineering","author":"Miyahara So","unstructured":"So Miyahara , Yoshiyuki Komazaki , and Sadaaki Miyamoto . 2014. An Algorithm Combining Spectral Clustering and DBSCAN for Core Points . In Knowledge and Systems Engineering , Van Nam Huynh, Thierry Denoeux, Dang Hung Tran, Anh Cuong Le, and Son Bao Pham (Eds.). Springer International Publishing , Cham , 21--28. https:\/\/doi.org\/10.1007\/978--3--319-02821--7_4 10.1007\/978--3--319-02821--7_4 So Miyahara, Yoshiyuki Komazaki, and Sadaaki Miyamoto. 2014. An Algorithm Combining Spectral Clustering and DBSCAN for Core Points. In Knowledge and Systems Engineering, Van Nam Huynh, Thierry Denoeux, Dang Hung Tran, Anh Cuong Le, and Son Bao Pham (Eds.). Springer International Publishing, Cham, 21--28. https:\/\/doi.org\/10.1007\/978--3--319-02821--7_4"},{"key":"e_1_3_2_2_47_1","volume-title":"A survey of recent advances in hierarchical clustering algorithms. The computer journal","author":"Murtagh Fionn","year":"1983","unstructured":"Fionn Murtagh . 1983. A survey of recent advances in hierarchical clustering algorithms. The computer journal , Vol. 26 , 4 ( 1983 ), 354--359. https:\/\/doi.org\/10.1093\/comjnl\/26.4.354 10.1093\/comjnl Fionn Murtagh. 1983. A survey of recent advances in hierarchical clustering algorithms. The computer journal, Vol. 26, 4 (1983), 354--359. https:\/\/doi.org\/10.1093\/comjnl\/26.4.354"},{"key":"e_1_3_2_2_48_1","volume-title":"1996 a","author":"Nene Sameer A.","year":"1996","unstructured":"Sameer A. Nene , Shree K. Nayar , and Hiroshi Murase . 1996 a . Columbia Object Image Library (COIL- 100). ( 1996 ). https:\/\/www.cs.columbia.edu\/CAVE\/software\/softlib\/coil-100.php Sameer A. Nene, Shree K. Nayar, and Hiroshi Murase. 1996 a. Columbia Object Image Library (COIL-100). (1996). https:\/\/www.cs.columbia.edu\/CAVE\/software\/softlib\/coil-100.php"},{"key":"e_1_3_2_2_49_1","unstructured":"Sameer A. Nene Shree K. Nayar and Hiroshi Murase. 1996 b. Columbia object image library (coil-20). (1996). https:\/\/www.cs.columbia.edu\/CAVE\/software\/softlib\/coil-20.php  Sameer A. Nene Shree K. Nayar and Hiroshi Murase. 1996 b. Columbia object image library (coil-20). (1996). https:\/\/www.cs.columbia.edu\/CAVE\/software\/softlib\/coil-20.php"},{"key":"e_1_3_2_2_50_1","volume-title":"On Spectral Clustering: Analysis and an algorithm","author":"Ng Andrew Y.","unstructured":"Andrew Y. Ng , Michael I. Jordan , and Yair Weiss . 2001. On Spectral Clustering: Analysis and an algorithm . In ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS. MIT Press , 849--856. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.19.8100 Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. 2001. On Spectral Clustering: Analysis and an algorithm. In ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS. MIT Press, 849--856. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.19.8100"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.5.733"},{"key":"e_1_3_2_2_52_1","volume-title":"Clustering by fast search and find of density peaks. science","author":"Rodriguez Alex","year":"2014","unstructured":"Alex Rodriguez and Alessandro Laio . 2014. Clustering by fast search and find of density peaks. science , Vol. 344 , 6191 ( 2014 ), 1492--1496. https:\/\/doi.org\/10.1126\/science.1242072 10.1126\/science.1242072 Alex Rodriguez and Alessandro Laio. 2014. Clustering by fast search and find of density peaks. science, Vol. 344, 6191 (2014), 1492--1496. https:\/\/doi.org\/10.1126\/science.1242072"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.031"},{"key":"e_1_3_2_2_54_1","first-page":"9","article-title":"Minimum spanning tree-based cluster analysis: A new algorithm for determining inconsistent edges","volume":"34","author":"Topcu Fadi","year":"2021","unstructured":"Fadi cS aar and Ahmet E. Topcu . 2021 . Minimum spanning tree-based cluster analysis: A new algorithm for determining inconsistent edges . Concurrency and Computation: Practice and Experience , Vol. 34 , 9 (Nov. 2021). https:\/\/doi.org\/10.1002\/cpe.6717 10.1002\/cpe.6717 Fadi cS aar and Ahmet E. Topcu. 2021. Minimum spanning tree-based cluster analysis: A new algorithm for determining inconsistent edges. Concurrency and Computation: Practice and Experience, Vol. 34, 9 (Nov. 2021). https:\/\/doi.org\/10.1002\/cpe.6717","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"e_1_3_2_2_55_1","volume-title":"Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data mining and knowledge discovery","author":"Sander J\u00f6rg","year":"1998","unstructured":"J\u00f6rg Sander , Martin Ester , Hans-Peter Kriegel , and Xiaowei Xu. 1998. Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data mining and knowledge discovery , Vol. 2 ( 1998 ), 169--194. https:\/\/doi.org\/10.1023\/A:1009745219419 10.1023\/A:1009745219419 J\u00f6rg Sander, Martin Ester, Hans-Peter Kriegel, and Xiaowei Xu. 1998. Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data mining and knowledge discovery , Vol. 2 (1998), 169--194. https:\/\/doi.org\/10.1023\/A:1009745219419"},{"key":"e_1_3_2_2_56_1","unstructured":"Erich Schubert Sibylle Hess and Katharina Morik. 2018. The Relationship of DBSCAN to Matrix Factorization and Spectral Clustering.. In LWDA. 330--334.  Erich Schubert Sibylle Hess and Katharina Morik. 2018. The Relationship of DBSCAN to Matrix Factorization and Spectral Clustering.. In LWDA. 330--334."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00074"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"e_1_3_2_2_61_1","volume-title":"Nature","volume":"221","author":"Wishart David","year":"1969","unstructured":"David Wishart . 1969 . Numerical classification method for deriving natural classes . Nature , Vol. 221 , 5175 (1969), 97--98. https:\/\/doi.org\/10.1038\/221097a0 10.1038\/221097a0 David Wishart. 1969. Numerical classification method for deriving natural classes. Nature, Vol. 221, 5175 (1969), 97--98. https:\/\/doi.org\/10.1038\/221097a0"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.131"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:16Z","timestamp":1750182676000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":65,"alternative-id":["10.1145\/3580305.3599283","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599283","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}