{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:34:43Z","timestamp":1778553283009,"version":"3.51.4"},"reference-count":55,"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":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1016\/j.knosys.2021.107295","type":"journal-article","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T11:58:01Z","timestamp":1626091081000},"page":"107295","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":58,"special_numbering":"C","title":["Effective hierarchical clustering based on structural similarities in nearest neighbor graphs"],"prefix":"10.1016","volume":"228","author":[{"given":"Chunrong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinglan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2304-4263","authenticated-orcid":false,"given":"Jia","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3691-3675","authenticated-orcid":false,"given":"Kenji","family":"Leibnitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunni","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.knosys.2021.107295_b1","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1016\/j.neuroimage.2008.12.015","article-title":"Cluster analysis of resting-state fMRI time series","volume":"45","author":"Mezer","year":"2009","journal-title":"Neuroimage"},{"key":"10.1016\/j.knosys.2021.107295_b2","series-title":"Proceedings of the Web Conference 2020","first-page":"2177","article-title":"Clustering and constructing user coresets to accelerate large-scale top-k recommender systems","author":"Jiang","year":"2020"},{"issue":"2","key":"10.1016\/j.knosys.2021.107295_b3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/isaf.1471","article-title":"Using clustering ensemble to identify banking business models","volume":"27","author":"Marques","year":"2020","journal-title":"Intelligent Systems in Accounting, Finance and Management"},{"key":"10.1016\/j.knosys.2021.107295_b4","series-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"MacQueen","year":"1967"},{"key":"10.1016\/j.knosys.2021.107295_b5","series-title":"Kdd","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester","year":"1996"},{"issue":"6191","key":"10.1016\/j.knosys.2021.107295_b6","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.1016\/j.knosys.2021.107295_b7","series-title":"The EM Algorithm and Extensions","author":"McLachlan","year":"2007"},{"key":"10.1016\/j.knosys.2021.107295_b8","series-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"824","article-title":"Scan: a structural clustering algorithm for networks","author":"Xu","year":"2007"},{"issue":"4","key":"10.1016\/j.knosys.2021.107295_b9","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/TKDE.2019.2892096","article-title":"Scalable spectral clustering for overlapping community detection in large-scale networks","volume":"32","author":"Van\u00a0Lierde","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"10.1016\/j.knosys.2021.107295_b10","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/TKDE.2018.2858782","article-title":"Low-rank sparse subspace for spectral clustering","volume":"31","author":"Zhu","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"10.1016\/j.knosys.2021.107295_b11","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TKDE.2019.2903410","article-title":"Ultra-scalable spectral clustering and ensemble clustering","volume":"32","author":"Huang","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2021.107295_b12","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.knosys.2018.10.022","article-title":"A study of graph-based system for multi-view clustering","volume":"163","author":"Wang","year":"2019","journal-title":"Knowl.-Based Syst."},{"issue":"7","key":"10.1016\/j.knosys.2021.107295_b13","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1109\/TPAMI.2018.2847335","article-title":"Binary multi-view clustering","volume":"41","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"10.1016\/j.knosys.2021.107295_b14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: Hierarchical clustering using dynamic modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"10.1016\/j.knosys.2021.107295_b15","series-title":"Introduction To HPC with MPI for Data Science","author":"Nielsen","year":"2016"},{"issue":"11","key":"10.1016\/j.knosys.2021.107295_b16","doi-asserted-by":"crossref","first-page":"8051","DOI":"10.1007\/s00521-018-3641-8","article-title":"A local cores-based hierarchical clustering algorithm for data sets with complex structures","volume":"31","author":"Cheng","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.knosys.2021.107295_b17","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","article-title":"Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy","volume":"133","author":"Yaohui","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2021.107295_b18","series-title":"Finding Groups in Data: An Introduction To Cluster Analysis","author":"Kaufman","year":"2009"},{"key":"10.1016\/j.knosys.2021.107295_b19","series-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","first-page":"1027","article-title":"K-means++: The advantages of careful seeding","author":"Arthur","year":"2007"},{"key":"10.1016\/j.knosys.2021.107295_b20","first-page":"1","article-title":"An efficient k-means clustering algorithm for tall data","author":"Cap\u00f3","year":"2020","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.knosys.2021.107295_b21","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.eswa.2017.11.020","article-title":"Comparative density peaks clustering","volume":"95","author":"Li","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2021.107295_b22","series-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"413","article-title":"Clustering of multiple density peaks","author":"Cai","year":"2018"},{"key":"10.1016\/j.knosys.2021.107295_b23","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.knosys.2017.02.027","article-title":"Natural neighbor-based clustering algorithm with local representatives","volume":"123","author":"Cheng","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2021.107295_b24","series-title":"International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)","first-page":"787","article-title":"KNN-DBSCAN: Using k-nearest neighbor information for parameter-free density based clustering","author":"Sharma","year":"2017"},{"issue":"6","key":"10.1016\/j.knosys.2021.107295_b25","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","article-title":"RNN-DBSCAN: A density-based clustering algorithm using reverse nearest neighbor density estimates","volume":"30","author":"Bryant","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"10.1016\/j.knosys.2021.107295_b26","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.14778\/2809974.2809980","article-title":"Scan++ efficient algorithm for finding clusters, hubs and outliers on large-scale graphs","volume":"8","author":"Shiokawa","year":"2015","journal-title":"Proc. of the VLDB Endow."},{"issue":"2","key":"10.1016\/j.knosys.2021.107295_b27","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TKDE.2016.2618795","article-title":"pSCAN: Fast and exact structural graph clustering","volume":"29","author":"Chang","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2021.107295_b28","series-title":"2014 IEEE 30th International Conference on Data Engineering","first-page":"292","article-title":"Linkscan*: Overlapping community detection using the link-space transformation","author":"Lim","year":"2014"},{"issue":"10","key":"10.1016\/j.knosys.2021.107295_b29","doi-asserted-by":"crossref","first-page":"1954","DOI":"10.1109\/TKDE.2018.2872553","article-title":"Efficient structural clustering on probabilistic graphs","volume":"31","author":"Qiu","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2021.107295_b30","article-title":"A new attributed graph clustering by using label propagation in complex networks","author":"Berahmand","year":"2020","journal-title":"J. of King Saudi Arab. Univ.-Computer and Inf. Sci."},{"issue":"4","key":"10.1016\/j.knosys.2021.107295_b31","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TCSS.2018.2879494","article-title":"Community detection in complex networks by detecting and expanding core nodes through extended local similarity of nodes","volume":"5","author":"Berahmand","year":"2018","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3299876","article-title":"Chameleon 2: An improved graph-based clustering algorithm","volume":"13","author":"Barton","year":"2019","journal-title":"ACM Trans. on Knowl. Discov. from Data (TKDD)"},{"issue":"5","key":"10.1016\/j.knosys.2021.107295_b33","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1016\/j.eswa.2014.09.054","article-title":"Efficient agglomerative hierarchical clustering","volume":"42","author":"Bouguettaya","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2021.107295_b34","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2016.08.086","article-title":"Denpehc: Density peak based efficient hierarchical clustering","volume":"373","author":"Xu","year":"2016","journal-title":"Inform. Sci."},{"issue":"3","key":"10.1016\/j.knosys.2021.107295_b35","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10994-016-5608-2","article-title":"QCC: A novel clustering algorithm based on quasi-cluster centers","volume":"106","author":"Huang","year":"2017","journal-title":"Mach. Learn."},{"issue":"11","key":"10.1016\/j.knosys.2021.107295_b36","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/T-C.1973.223640","article-title":"Clustering using a similarity measure based on shared near neighbors","volume":"100","author":"Jarvis","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.knosys.2021.107295_b37","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.patcog.2017.09.038","article-title":"Clustering-based k-nearest neighbor classification for large-scale data with neural codes representation","volume":"74","author":"Gallego","year":"2018","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.knosys.2021.107295_b38","series-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"577","article-title":"Ranking outliers using symmetric neighborhood relationship","author":"Jin","year":"2006"},{"key":"10.1016\/j.knosys.2021.107295_b39","series-title":"Introduction to algorithms","author":"Cormen","year":"2009"},{"issue":"5814","key":"10.1016\/j.knosys.2021.107295_b40","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"Frey","year":"2007","journal-title":"Science"},{"key":"10.1016\/j.knosys.2021.107295_b41","series-title":"16th IEEE International Conference on Tools with Artificial Intelligence","first-page":"576","article-title":"Determining the number of clusters\/segments in hierarchical clustering\/segmentation algorithms","author":"Salvador","year":"2004"},{"key":"10.1016\/j.knosys.2021.107295_b42","series-title":"Clustering benchmarks","author":"Barton","year":"2020"},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b43","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/1471-2105-8-3","article-title":"FLAME, a novel fuzzy clustering method for the analysis of dna microarray data","volume":"8","author":"Fu","year":"2007","journal-title":"BMC Bioinformatics"},{"key":"10.1016\/j.knosys.2021.107295_b44","series-title":"K-means properties on six clustering benchmark datasets","first-page":"4743","author":"Fr\u00e4nti","year":"2018"},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b45","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1217299.1217303","article-title":"Clustering aggregation","volume":"1","author":"Gionis","year":"2007","journal-title":"ACM Trans. on Knowl. Discov. from Data (TKDD)"},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b46","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"100","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b47","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","article-title":"Robust path-based spectral clustering","volume":"41","author":"Chang","year":"2008","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.knosys.2021.107295_b48","series-title":"International Conference on Pattern Recognition and Machine Intelligence","first-page":"1","article-title":"Data clustering: A user\u2019s dilemma","author":"Jain","year":"2005"},{"key":"10.1016\/j.knosys.2021.107295_b49","series-title":"CLUTO-a Clustering toolkit","author":"Karypis","year":"2002"},{"issue":"9","key":"10.1016\/j.knosys.2021.107295_b50","doi-asserted-by":"crossref","first-page":"1834","DOI":"10.1109\/TKDE.2017.2701825","article-title":"Discrete nonnegative spectral clustering","volume":"29","author":"Yang","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10.1016\/j.knosys.2021.107295_b51","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"J. Classification"},{"key":"10.1016\/j.knosys.2021.107295_b52","series-title":"UCI machine learning repository","author":"Dua","year":"2017"},{"issue":"2","key":"10.1016\/j.knosys.2021.107295_b53","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2021.107295_b54","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: a graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"10.1016\/j.knosys.2021.107295_b55","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1109\/3477.623240","article-title":"A novel multiseed nonhierarchical data clustering technique","volume":"27","author":"Chaudhuri","year":"1997","journal-title":"IEEE Trans. Syst. Man Cybern. B"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705121005578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705121005578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T04:30:12Z","timestamp":1760589012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705121005578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":55,"alternative-id":["S0950705121005578"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2021.107295","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Effective hierarchical clustering based on structural similarities in nearest neighbor graphs","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2021.107295","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":"107295"}}