{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:34:21Z","timestamp":1770978861345,"version":"3.50.1"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603101"],"award-info":[{"award-number":["61603101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876043"],"award-info":[{"award-number":["61876043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976052"],"award-info":[{"award-number":["61976052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71702065"],"award-info":[{"award-number":["71702065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003009","name":"Science and Technology Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003009","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["B10120210117-OF09"],"award-info":[{"award-number":["B10120210117-OF09"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["62122022"],"award-info":[{"award-number":["62122022"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022813","name":"The Chinese University of Hong Kong - Shenzhen","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100022813","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021ZD0111501"],"award-info":[{"award-number":["2021ZD0111501"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2902004"],"award-info":[{"award-number":["2022YFB2902004"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014857","name":"National Natural Science Foundation of China-Guangdong Joint Fund","doi-asserted-by":"publisher","award":["U1501254"],"award-info":[{"award-number":["U1501254"]}],"id":[{"id":"10.13039\/501100014857","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1016\/j.ins.2024.120114","type":"journal-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T21:05:42Z","timestamp":1704834342000},"page":"120114","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["UP-DPC: Ultra-scalable parallel density peak clustering"],"prefix":"10.1016","volume":"660","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1440-9299","authenticated-orcid":false,"given":"Luyao","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1403-3324","authenticated-orcid":false,"given":"Geping","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9306-4489","authenticated-orcid":false,"given":"Yiyang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Zhiguo","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Hao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.ins.2024.120114_br0010","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2024.120114_br0020","series-title":"SIGKDD, vol. 96","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996"},{"issue":"6191","key":"10.1016\/j.ins.2024.120114_br0030","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.ins.2024.120114_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119788","article-title":"SFKNN-DPC: standard deviation weighted distance based density peak clustering algorithm","volume":"653","author":"Xie","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0050","series-title":"ECCV","first-page":"705","article-title":"Quick shift and kernel methods for mode seeking","author":"Vedaldi","year":"2008"},{"issue":"8","key":"10.1016\/j.ins.2024.120114_br0060","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/34.400568","article-title":"Mean shift, mode seeking, and clustering","volume":"17","author":"Cheng","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2024.120114_br0070","series-title":"ICML","first-page":"2294","article-title":"Quickshift++: provably good initializations for sample-based mean shift","author":"Jiang","year":"2018"},{"key":"10.1016\/j.ins.2024.120114_br0080","series-title":"ECML-PKDD","first-page":"138","article-title":"Fastdec: clustering by fast dominance estimation","author":"Yang","year":"2022"},{"key":"10.1016\/j.ins.2024.120114_br0090","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ins.2021.09.048","article-title":"Quickdsc: clustering by quick density subgraph estimation","volume":"581","author":"Zheng","year":"2021","journal-title":"Inf. Sci."},{"issue":"5","key":"10.1016\/j.ins.2024.120114_br0100","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1109\/TKDE.2020.3004221","article-title":"Index-based solutions for efficient density peak clustering","volume":"34","author":"Rasool","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.120114_br0110","series-title":"APWeb-WAIM","first-page":"1","article-title":"Ultra-dpc: ultra-scalable and index-free density peak clustering","author":"Ma","year":"2023"},{"key":"10.1016\/j.ins.2024.120114_br0120","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","article-title":"Shared-nearest-neighbor-based clustering by fast search and find of density peaks","volume":"450","author":"Liu","year":"2018","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0130","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","article-title":"Study on density peaks clustering based on k-nearest neighbors and principal component analysis","volume":"99","author":"Du","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2024.120114_br0140","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.ins.2022.11.091","article-title":"VDPC: variational density peak clustering algorithm","volume":"621","author":"Wang","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0150","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.ins.2022.03.091","article-title":"Clustering based on local density peaks and graph cut","volume":"600","author":"Long","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119470","article-title":"Fast density peaks clustering algorithm based on improved mutual k-nearest-neighbor and sub-cluster merging","volume":"647","author":"Li","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0170","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ins.2023.01.144","article-title":"Clustering by fast detection of main density peaks within a peak digraph","volume":"628","author":"Guan","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0180","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.ins.2022.12.078","article-title":"An improved density peaks clustering algorithm based on natural neighbor with a merging strategy","volume":"624","author":"Ding","year":"2023","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ins.2024.120114_br0190","doi-asserted-by":"crossref","first-page":"193","DOI":"10.3390\/info11040193","article-title":"Machine learning in python: main developments and technology trends in data science, machine learning, and artificial intelligence","volume":"11","author":"Raschka","year":"2020","journal-title":"Information"},{"key":"10.1016\/j.ins.2024.120114_br0200","series-title":"ECML-PKDD","first-page":"364","article-title":"Model-based clustering with hdbscan","author":"Strobl","year":"2021"},{"issue":"2","key":"10.1016\/j.ins.2024.120114_br0210","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0031-3203(78)90018-3","article-title":"Agglomerative clustering using the concept of mutual nearest neighbourhood","volume":"10","author":"Gowda","year":"1978","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2024.120114_br0220","author":"McInnes"},{"key":"10.1016\/j.ins.2024.120114_br0230","series-title":"Berkeley Symp. Math. Statist. Probability","first-page":"281","article-title":"Classification and analysis of multivariate observations","author":"MacQueen","year":"1967"},{"issue":"1","key":"10.1016\/j.ins.2024.120114_br0240","first-page":"100","article-title":"Algorithm as 136: a k-means clustering algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"J. R. Stat. Soc., Ser. C, Appl. Stat."},{"key":"10.1016\/j.ins.2024.120114_br0250","series-title":"DASFAA","first-page":"556","article-title":"Litewsc: a lightweight framework for web-scale spectral clustering","author":"Yang","year":"2022"},{"key":"10.1016\/j.ins.2024.120114_br0260","series-title":"IJCAI","article-title":"Beyond the Nystr\u00f6m approximation: speeding up spectral clustering using uniform sampling and weighted kernel k-means","author":"Mohan","year":"2017"},{"key":"10.1016\/j.ins.2024.120114_br0270","first-page":"313","article-title":"Large Scale Spectral Clustering with Landmark-Based Representation","volume":"vol. 25","author":"Chen","year":"2011"},{"issue":"6","key":"10.1016\/j.ins.2024.120114_br0280","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.ins.2024.120114_br0290","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ins.2020.07.018","article-title":"Graphlshc: towards large scale spectral hypergraph clustering","volume":"544","author":"Yang","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.120114_br0300","first-page":"1","article-title":"Litewsec: a lightweight framework for web-scale spectral ensemble clustering","author":"Yang","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.120114_br0310","series-title":"STOC","first-page":"568","article-title":"Bridging between 0\/1 and linear programming via random walks","author":"Brakensiek","year":"2019"},{"issue":"1","key":"10.1016\/j.ins.2024.120114_br0320","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/TSMC.2018.2876202","article-title":"Enhanced ensemble clustering via fast propagation of cluster-wise similarities","volume":"51","author":"Huang","year":"2018","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.ins.2024.120114_br0330","series-title":"Mathematical Statistics and Data Analysis","author":"Rice","year":"2006"},{"key":"10.1016\/j.ins.2024.120114_br0340","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."},{"key":"10.1016\/j.ins.2024.120114_br0350","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2022.109275","article-title":"Reskm: a general framework to accelerate large-scale spectral clustering","volume":"137","author":"Yang","year":"2023","journal-title":"Pattern Recognit."},{"issue":"3","key":"10.1016\/j.ins.2024.120114_br0360","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","article-title":"Billion-scale similarity search with gpus","volume":"7","author":"Johnson","year":"2019","journal-title":"IEEE Trans. Big Data"},{"key":"10.1016\/j.ins.2024.120114_br0370","series-title":"WWW","first-page":"1177","article-title":"Web-scale k-means clustering","author":"Sculley","year":"2010"},{"key":"10.1016\/j.ins.2024.120114_br0380","first-page":"2825","article-title":"Scikit-learn: machine learning in python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.ins.2024.120114_br0390","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","article-title":"Clustering with local density peaks-based minimum spanning tree","volume":"33","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"10.1016\/j.ins.2024.120114_br0400","doi-asserted-by":"crossref","first-page":"4767","DOI":"10.1109\/TKDE.2022.3150403","article-title":"Fast LDP-MST: an efficient density-peak-based clustering method for large-size datasets","volume":"35","author":"Qiu","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.120114_br0410","series-title":"PAKDD","first-page":"160","article-title":"Density-based clustering based on hierarchical density estimates","author":"Campello","year":"2013"},{"key":"10.1016\/j.ins.2024.120114_br0420","series-title":"ICML","first-page":"1073","article-title":"Information theoretic measures for clusterings comparison: is a correction for chance necessary?","author":"Vinh","year":"2009"},{"key":"10.1016\/j.ins.2024.120114_br0430","series-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction, vol. 2","author":"Hastie","year":"2009"},{"issue":"5","key":"10.1016\/j.ins.2024.120114_br0440","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","article-title":"Iterative shrinking method for clustering problems","volume":"39","author":"Fr\u00e4nti","year":"2006","journal-title":"Pattern Recognit."},{"issue":"5","key":"10.1016\/j.ins.2024.120114_br0450","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/34.291440","article-title":"A database for handwritten text recognition research","volume":"16","author":"Hull","year":"1994","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"10.1016\/j.ins.2024.120114_br0460","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","article-title":"Gradient-based learning applied to document recognition","volume":"86","author":"LeCun","year":"1998","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.ins.2024.120114_br0470","series-title":"IJCNN","first-page":"2921","article-title":"Emnist: extending mnist to handwritten letters","author":"Cohen","year":"2017"},{"key":"10.1016\/j.ins.2024.120114_br0480","series-title":"Large Scale Kernel Machines, vol. 2","article-title":"Training invariant support vector machines using selective sampling","author":"Loosli","year":"2007"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524000276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524000276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T14:05:56Z","timestamp":1762178756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025524000276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":48,"alternative-id":["S0020025524000276"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2024.120114","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"UP-DPC: Ultra-scalable parallel density peak clustering","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2024.120114","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"120114"}}