{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T12:19:38Z","timestamp":1772885978742,"version":"3.50.1"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1016\/j.datak.2021.101922","type":"journal-article","created":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T10:59:47Z","timestamp":1629889187000},"page":"101922","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":41,"special_numbering":"C","title":["DBHC: A DBSCAN-based hierarchical clustering algorithm"],"prefix":"10.1016","volume":"135","author":[{"given":"Alireza","family":"Latifi-Pakdehi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3951-4060","authenticated-orcid":false,"given":"Negin","family":"Daneshpour","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.datak.2021.101922_b1","first-page":"1","article-title":"AA-DBSCAN: an approximate adaptive DBSCAN for finding clusters with varying densities","volume":"75","author":"Kim","year":"2018","journal-title":"J. Supercomput."},{"key":"10.1016\/j.datak.2021.101922_b2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.neucom.2015.05.109","article-title":"An efficient and scalable density-based clustering algorithm for datasets with complex structures","volume":"171","author":"Lv","year":"2016","journal-title":"Neurocomputing"},{"issue":"10","key":"10.1016\/j.datak.2021.101922_b3","doi-asserted-by":"crossref","first-page":"1456","DOI":"10.1016\/j.patrec.2011.04.008","article-title":"Bagging-based spectral clustering ensemble selection","volume":"32","author":"Jia","year":"2011","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.datak.2021.101922_b4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.engappai.2014.12.005","article-title":"Hierarchical cluster ensemble selection","volume":"39","author":"Akbari","year":"2015","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.datak.2021.101922_b5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0896-8411(03)00064-7","article-title":"Cluster analysis of human autoantibody reactivities in health and in type 1 diabetes mellitus: a bio-informatic approach to immune complexity","volume":"21","author":"Quintana","year":"2003","journal-title":"J. Autoimmun."},{"issue":"3","key":"10.1016\/j.datak.2021.101922_b6","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1016\/j.ejor.2013.11.002","article-title":"Mining categorical sequences from data using a hybrid clustering method","volume":"234","author":"De\u00a0Angelis","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.datak.2021.101922_b7","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.engappai.2011.09.017","article-title":"Gene expression data analysis with the clustering method based on an improved quantum-behaved particle swarm optimization","volume":"25","author":"Sun","year":"2012","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.datak.2021.101922_b8","series-title":"Data Mining: Concepts and Techniques","author":"Han","year":"2011"},{"key":"10.1016\/j.datak.2021.101922_b9","series-title":"2015 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","first-page":"148","article-title":"A new hierarchical clustering algorithm","author":"Nazari","year":"2015"},{"key":"10.1016\/j.datak.2021.101922_b10","series-title":"Kdd","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"vol. 96","author":"Ester","year":"1996"},{"issue":"6","key":"10.1016\/j.datak.2021.101922_b11","doi-asserted-by":"crossref","first-page":"2939","DOI":"10.1016\/j.eswa.2013.10.025","article-title":"Algorithm to determine \u025b-distance parameter in density based clustering","volume":"41","author":"Jahirabadkar","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.datak.2021.101922_b12","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.chemolab.2012.11.006","article-title":"Revised DBSCAN algorithm to cluster data with dense adjacent clusters","volume":"120","author":"Tran","year":"2013","journal-title":"Chemometr. Intell. Lab. Syst."},{"key":"10.1016\/j.datak.2021.101922_b13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.patcog.2016.03.008","article-title":"A fast DBSCAN clustering algorithm by accelerating neighbor searching using groups method","volume":"58","author":"Kumar","year":"2016","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.datak.2021.101922_b14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.patcog.2018.05.030","article-title":"A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data","volume":"83","author":"Chen","year":"2018","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.datak.2021.101922_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107624","article-title":"BLOCK-DBSCAN: Fast clustering for large scale data","volume":"109","author":"Chen","year":"2021","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.datak.2021.101922_b16","series-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"245","article-title":"Dboost: a fast algorithm for dbscan-based clustering on high dimensional data","author":"Zhang","year":"2016"},{"key":"10.1016\/j.datak.2021.101922_b17","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1007\/s10586-017-0818-3","article-title":"A novel DBSCAN with entropy and probability for mixed data","volume":"20","author":"Liu","year":"2017","journal-title":"Cluster Comput."},{"key":"10.1016\/j.datak.2021.101922_b18","article-title":"K-DBSCAN: An improved DBSCAN algorithm for big data","author":"Gholizadeh","year":"2020","journal-title":"J. Supercomput."},{"key":"10.1016\/j.datak.2021.101922_b19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.comcom.2020.12.019","article-title":"A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm","volume":"167","author":"Li","year":"2021","journal-title":"Comput. Commun."},{"key":"10.1016\/j.datak.2021.101922_b20","series-title":"2006 IEEE International Conference on Systems, Man and Cybernetics","first-page":"2976","article-title":"Gridbscan: Grid density-based spatial clustering of applications with noise","volume":"vol. 4","author":"Uncu","year":"2006"},{"key":"10.1016\/j.datak.2021.101922_b21","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1016\/j.phpro.2012.02.174","article-title":"Grid-based DBSCAN algorithm with referential parameters","volume":"24","author":"Darong","year":"2012","journal-title":"Physics Procedia"},{"issue":"1","key":"10.1016\/j.datak.2021.101922_b22","first-page":"14","article-title":"A dynamic method for discovering density varied clusters","volume":"6","author":"Elbatta","year":"2013","journal-title":"Int. J. Signal Process., Imag. Process. Pattern Recognit."},{"issue":"2","key":"10.1016\/j.datak.2021.101922_b23","first-page":"11","article-title":"AutoEpsDBSCAN: DBSCAN with Eps automatic for large dataset","volume":"2","author":"Gaonkar","year":"2013","journal-title":"Int. J. Adv. Comput. Theory Eng."},{"issue":"4","key":"10.1016\/j.datak.2021.101922_b24","article-title":"Adaptive methods for determining DBSCAN parameters","volume":"1","author":"Sawant","year":"2014","journal-title":"Int. J. Innov. Sci., Eng. Technol."},{"key":"10.1016\/j.datak.2021.101922_b25","series-title":"ACM Sigmod Record","first-page":"49","article-title":"Optics: ordering points to identify the clustering structure","volume":"vol. 28","author":"Ankerst","year":"1999"},{"key":"10.1016\/j.datak.2021.101922_b26","series-title":"Asian Conference on Intelligent Information and Database Systems","first-page":"93","article-title":"A novel method to find appropriate \u025b for DBSCAN","author":"Esmaelnejad","year":"2010"},{"issue":"7","key":"10.1016\/j.datak.2021.101922_b27","article-title":"Choosing dbscan parameters automatically using differential evolution","volume":"91","author":"Karami","year":"2014","journal-title":"Int. J. Comput. Appl."},{"issue":"2","key":"10.1016\/j.datak.2021.101922_b28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0169-7439(01)00111-3","article-title":"Looking for natural patterns in data: Part 1. Density-based approach","volume":"56","author":"Daszykowski","year":"2001","journal-title":"Chemometr. Intell. Lab. Syst."},{"key":"10.1016\/j.datak.2021.101922_b29","series-title":"18th International Conference on Artificial Intelligence and Soft Computing (ICAISC)","first-page":"420","article-title":"Determining the eps parameter of the DBSCAN algorithm","author":"Starczewski","year":"2019"},{"key":"10.1016\/j.datak.2021.101922_b30","series-title":"International Congress on Information and Communication Technology, Advances in Intelligent Systems and Computing","first-page":"433","article-title":"Efficient density-based clustering using automatic parameter detection","author":"Sharma","year":"2016"},{"key":"10.1016\/j.datak.2021.101922_b31","series-title":"5th International Conference on Systems and Informatics (ICSAI)","first-page":"1062","article-title":"The parameter configuration method of DBSCAN clustering algorithm","author":"yu\u00a0Song","year":"2018"},{"key":"10.1016\/j.datak.2021.101922_b32","series-title":"Progress in Advanced Computing and Intelligent Engineering","first-page":"213","article-title":"AEDBSCAN\u2014Adaptive epsilon density-based spatial clustering of applications with noise","author":"Mistry","year":"2021"},{"key":"10.1016\/j.datak.2021.101922_b33","series-title":"Artificial Intelligence and Soft Computing (ICAISC)","first-page":"555","article-title":"Grid-based approach to determining parameters of the DBSCAN algorithm","author":"Starczewski","year":"2020"},{"key":"10.1016\/j.datak.2021.101922_b34","article-title":"A novel method to enhance the performance evaluation of DBSCAN clustering algorithm using different distinguished metrics","author":"Valarmathy","year":"2020","journal-title":"J. Mater. Today: Proc."},{"key":"10.1016\/j.datak.2021.101922_b35","series-title":"Partitional Clustering Algorithms","first-page":"193","article-title":"Density based clustering: Alternatives to DBSCAN","author":"Braune","year":"2015"},{"key":"10.1016\/j.datak.2021.101922_b36","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.knosys.2016.12.006","article-title":"Sparse learning based fuzzy c-means clustering","volume":"119","author":"Gu","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.datak.2021.101922_b37","doi-asserted-by":"crossref","first-page":"33261","DOI":"10.1007\/s11042-019-07885-7","article-title":"Sparse learning based on clustering by fast search and find of density peaks","volume":"78","author":"Li","year":"2019","journal-title":"Multimedia Tools Appl."},{"key":"10.1016\/j.datak.2021.101922_b38","series-title":"Introduction to Algorithms","author":"Cormen","year":"2009"},{"key":"10.1016\/j.datak.2021.101922_b39","series-title":"UCI machine learning repository","author":"Bache","year":"2013"},{"key":"10.1016\/j.datak.2021.101922_b40","series-title":"Data Clustering: Algorithms and Applications","author":"Aggarwal","year":"2013"},{"key":"10.1016\/j.datak.2021.101922_b41","series-title":"Grouping Multidimensional Data","article-title":"A survey of clustering data mining techniques","author":"Berkhin","year":"2006"},{"key":"10.1016\/j.datak.2021.101922_b42","unstructured":"M. Charrad, Y. Lechevallier, M.B. Ahmed, G. Saporta, On the number of clusters in block clustering algorithms, in: FLAIRS Conference, 2010."},{"issue":"2","key":"10.1016\/j.datak.2021.101922_b43","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","volume":"1","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.datak.2021.101922_b44","series-title":"Silhouettes: a graphical aid to the interpretation and validation of cluster analysis","first-page":"53","author":"Rousseeuw","year":"1987"},{"key":"10.1016\/j.datak.2021.101922_b45","series-title":"An extensive comparative study of cluster validity indices","first-page":"243","author":"Arbelaitz","year":"2013"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X21000495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X21000495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:18:47Z","timestamp":1759191527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X21000495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":45,"alternative-id":["S0169023X21000495"],"URL":"https:\/\/doi.org\/10.1016\/j.datak.2021.101922","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DBHC: A DBSCAN-based hierarchical clustering algorithm","name":"articletitle","label":"Article Title"},{"value":"Data & Knowledge Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.datak.2021.101922","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"101922"}}