{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T14:16:40Z","timestamp":1783174600756,"version":"3.54.6"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T00:00:00Z","timestamp":1781308800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovation Fund Denmark","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.is.2026.102768","type":"journal-article","created":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T16:41:25Z","timestamp":1781455285000},"page":"102768","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximate hierarchical density-based clustering using graph-based search indexes"],"prefix":"10.1016","volume":"142","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1904-4024","authenticated-orcid":false,"given":"Camilla Birch","family":"Okkels","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1639-3534","authenticated-orcid":false,"given":"Erik","family":"Thordsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7212-6476","authenticated-orcid":false,"given":"Martin","family":"Aum\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7713-4208","authenticated-orcid":false,"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.is.2026.102768_b1","series-title":"Similarity Search and Applications - 18th International Conference, SISAP 2025, Reykjavik, Iceland, October 1-3, 2025, Proceedings","first-page":"233","article-title":"Approximate Single-Linkage clustering using Graph-Based indexes: MST-Based approaches and incremental searchers","author":"Okkels","year":"2025"},{"key":"10.1016\/j.is.2026.102768_b2","series-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), Portland, Oregon, USA","first-page":"226","article-title":"A density-Based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996"},{"issue":"2","key":"10.1016\/j.is.2026.102768_b3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","article-title":"The (black) art of runtime evaluation: Are we comparing algorithms or implementations?","volume":"52","author":"Kriegel","year":"2017","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"10.1016\/j.is.2026.102768_b4","doi-asserted-by":"crossref","first-page":"19:1","DOI":"10.1145\/3068335","article-title":"DBSCAN revisited, revisited: Why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2026.102768_b5","unstructured":"R. Weber, H. Schek, S. Blott, A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces, in: VLDB\u201998, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, 1998, pp. 194\u2013205."},{"key":"10.1016\/j.is.2026.102768_b6","series-title":"IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015","first-page":"136","article-title":"Probabilistic polynomials and hamming nearest neighbors","author":"Alman","year":"2015"},{"issue":"4","key":"10.1016\/j.is.2026.102768_b7","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"42","author":"Malkov","year":"2020","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.is.2026.102768_b8","doi-asserted-by":"crossref","first-page":"43:1","DOI":"10.1145\/3709693","article-title":"Graph-Based vector search: An experimental evaluation of the state-of-the-art","volume":"3","author":"Azizi","year":"2025","journal-title":"Proc. ACM Manag. Data"},{"issue":"3","key":"10.1016\/j.is.2026.102768_b9","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/3083897","article-title":"On the hardness and approximation of Euclidean DBSCAN","volume":"42","author":"Gan","year":"2017","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2026.102768_b10","series-title":"Proceedings 28th International Conference on Extending Database Technology, EDBT 2025, Barcelona, Spain, March 25-28, 2025","first-page":"694","article-title":"High-dimensional density-based clustering using locality-sensitive hashing","author":"Okkels","year":"2025"},{"issue":"4","key":"10.1016\/j.is.2026.102768_b11","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1007\/s10618-017-0498-x","article-title":"Scalable density-based clustering with quality guarantees using random projections","volume":"31","author":"Schneider","year":"2017","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.is.2026.102768_b12","unstructured":"H. Xu, N. Pham, Scalable DBSCAN with Random Projections, in: Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, NeurIPS 2024, Vancouver, BC, Canada, December 10 - 15, 2024, 2024."},{"key":"10.1016\/j.is.2026.102768_b13","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003","first-page":"547","article-title":"Navigating massive data sets via local clustering","author":"Houle","year":"2003"},{"key":"10.1016\/j.is.2026.102768_b14","series-title":"SIGMOD \u201921: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021","first-page":"1982","article-title":"Fast parallel algorithms for Euclidean minimum spanning tree and hierarchical spatial clustering","author":"Wang","year":"2021"},{"issue":"1","key":"10.1016\/j.is.2026.102768_b15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TBDATA.2019.2907624","article-title":"Hierarchical density-based clustering using MapReduce","volume":"7","author":"dos Santos","year":"2021","journal-title":"IEEE Trans. Big Data"},{"key":"10.1016\/j.is.2026.102768_b16","series-title":"SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023","first-page":"49","article-title":"Faster parallel exact density peaks clustering","author":"Huang","year":"2023"},{"issue":"1","key":"10.1016\/j.is.2026.102768_b17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","article-title":"Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive hashing","volume":"12","author":"Koga","year":"2007","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.is.2026.102768_b18","unstructured":"A. Abboud, V. Cohen-Addad, H. Houdrouge, Subquadratic High-Dimensional Hierarchical Clustering, in: Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, 2019, pp. 11576\u201311586."},{"key":"10.1016\/j.is.2026.102768_b19","series-title":"Similarity Search and Applications - 17th International Conference, SISAP 2024, Providence, RI, USA, November 4-6, 2024, Proceedings","first-page":"170","article-title":"On the design of scalable outlier detection methods using approximate nearest neighbor graphs","author":"Okkels","year":"2024"},{"key":"10.1016\/j.is.2026.102768_b20","series-title":"Similarity Search and Applications - 17th International Conference, SISAP 2024, Providence, RI, USA, November 4-6, 2024, Proceedings","first-page":"238","article-title":"Hierarchical clustering without pairwise distances by incremental similarity search","author":"Schubert","year":"2024"},{"key":"10.1016\/j.is.2026.102768_b21","series-title":"Advances in Knowledge Discovery and Data Mining, 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II","first-page":"160","article-title":"Density-Based clustering based on hierarchical density estimates","author":"Campello","year":"2013"},{"key":"10.1016\/j.is.2026.102768_b22","article-title":"A statistical method for evaluating systematic relationships","author":"Sokal","year":"1958","journal-title":"Univ. Kans. Sci. Bull."},{"issue":"1","key":"10.1016\/j.is.2026.102768_b23","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","article-title":"SLINK: An optimally efficient algorithm for the single-link cluster method","volume":"16","author":"Sibson","year":"1973","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/j.is.2026.102768_b24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Am. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/1088-6826","issn-type":"print"},{"issue":"2","key":"10.1016\/j.is.2026.102768_b25","article-title":"Density-based clustering","volume":"10","author":"Campello","year":"2020","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"10.1016\/j.is.2026.102768_b26","series-title":"Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, April 24-26, 2014","first-page":"839","article-title":"Density-Based clustering validation","author":"Moulavi","year":"2014"},{"key":"10.1016\/j.is.2026.102768_b27","series-title":"SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadelphia, Pennsylvania, USA","first-page":"49","article-title":"OPTICS: Ordering points to identify the clustering structure","author":"Ankerst","year":"1999"},{"issue":"1","key":"10.1016\/j.is.2026.102768_b28","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/2733381","article-title":"Hierarchical density estimates for data clustering, visualization, and outlier detection","volume":"10","author":"Campello","year":"2015","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.is.2026.102768_b29","series-title":"Similarity Search and Applications - 18th International Conference, SISAP 2025, Reykjavik, Iceland, October 1-3, 2025, Proceedings","first-page":"273","article-title":"Theoretical and practical insights into Graph-Based indexing","author":"Thordsen","year":"2025"},{"key":"10.1016\/j.is.2026.102768_b30","series-title":"Similarity Search and Applications - 18th International Conference, SISAP 2025, Reykjavik, Iceland, October 1-3, 2025, Proceedings","first-page":"263","article-title":"Hierarchical density-based clustering using incremental similarity search","author":"Schubert","year":"2025"},{"key":"10.1016\/j.is.2026.102768_b31","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10.1016\/j.is.2026.102768_b32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/1217208","article-title":"The comparison of dendrograms by objective methods","volume":"11","author":"Sokal","year":"1962","journal-title":"TAXON","ISSN":"https:\/\/id.crossref.org\/issn\/1996-8175","issn-type":"print"},{"key":"10.1016\/j.is.2026.102768_b33","series-title":"SciPy 1.0-Fundamental algorithms for scientific computing in Python","author":"Virtanen","year":"2019"},{"key":"10.1016\/j.is.2026.102768_b34","series-title":"Data Mining Workshops (ICDMW), 2017 IEEE International Conference on","first-page":"33","article-title":"Accelerated hierarchical density based clustering","author":"McInnes","year":"2017"},{"key":"10.1016\/j.is.2026.102768_b35","series-title":"Proc. 1th Int. Conf. on Similarity Search and Applications, SISAP","first-page":"205","article-title":"Automatic indexing for similarity search in ELKI","author":"Schubert","year":"2022"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T13:28:11Z","timestamp":1783171691000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437926000827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":35,"alternative-id":["S0306437926000827"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2026.102768","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate hierarchical density-based clustering using graph-based search indexes","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2026.102768","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102768"}}