{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:44:21Z","timestamp":1759826661038,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61472049","61572225"],"award-info":[{"award-number":["61472049","61572225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Jilin Province Science & Technology Department Foundation","award":["20190302071GX"],"award-info":[{"award-number":["20190302071GX"]}]},{"name":"Jilin Provincial Science & Technology Department Foundation","award":["20200201164JC"],"award-info":[{"award-number":["20200201164JC"]}]},{"name":"Development and Reform Commission Foundation of Jilin province","award":["2019C053-11"],"award-info":[{"award-number":["2019C053-11"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11063-022-10972-w","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T16:03:16Z","timestamp":1662566596000},"page":"3899-3922","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["ROCM: A Rolling Iteration Clustering Model Via Extracting Data Features"],"prefix":"10.1007","volume":"55","author":[{"given":"Linliang","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Limin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6213-5600","authenticated-orcid":false,"given":"Xuming","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"issue":"6","key":"10972_CR1","doi-asserted-by":"crossref","first-page":"3298","DOI":"10.1109\/TCYB.2019.2952398","volume":"51","author":"L Xing","year":"2021","unstructured":"Xing L, Chen B, Du S, Gu Y, Zheng N (2021) Correntropy-based multiview subspace clustering. IEEE Trans Cybern 51(6):3298\u20133311","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"10972_CR2","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/TIT.2020.3039114","volume":"67","author":"J Wu","year":"2021","unstructured":"Wu J, Huang L, Yang M, Liu C (2021) Sparse subspace clustering via two-step reweighted l1-minimization: Algorithm and provable neighbor recovery rates. IEEE Trans Inf Theory 67(2):1216\u20131263","journal-title":"IEEE Trans Inf Theory"},{"key":"10972_CR3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.patrec.2018.12.010","volume":"117","author":"D Luchi","year":"2019","unstructured":"Luchi D, Rodrigues AL, Varej\u00e3o FM (2019) Sampling approaches for applying DBSCAN to large datasets. Pattern Recognit Lett 117:90\u201396","journal-title":"Pattern Recognit Lett"},{"issue":"7","key":"10972_CR4","doi-asserted-by":"crossref","first-page":"e5575","DOI":"10.1002\/cpe.5575","volume":"32","author":"P Xie","year":"2020","unstructured":"Xie P, Lv M, Zhao J (2020) An improved energy-low clustering hierarchy protocol based on ensemble algorithm. Concurr Comput Pract Exp 32(7):e5575","journal-title":"Concurr Comput Pract Exp"},{"issue":"8","key":"10972_CR5","doi-asserted-by":"crossref","first-page":"e5758","DOI":"10.1002\/cpe.5758","volume":"33","author":"J Lin","year":"2021","unstructured":"Lin J, Wu L, Chen R, Wu J, Wang X (2021) Double-weighted fuzzy clustering with samples and generalized entropy features. Concurr Comput Pract Exp 33(8):e5758","journal-title":"Concurr Comput Pract Exp"},{"key":"10972_CR6","doi-asserted-by":"crossref","first-page":"107554","DOI":"10.1016\/j.patcog.2020.107554","volume":"108","author":"J Hou","year":"2020","unstructured":"Hou J, Zhang A, Qi N (2020) Density peak clustering based on relative density relationship. Pattern Recognit 108:107554","journal-title":"Pattern Recognit"},{"issue":"3","key":"10972_CR7","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.1109\/TII.2020.2993842","volume":"17","author":"X Li","year":"2021","unstructured":"Li X, Jiang Y, Li M, Yin S (2021) Lightweight attention convolutional neural network for retinal vessel image segmentation. IEEE Trans Ind Informatics 17(3):1958\u20131967","journal-title":"IEEE Trans Ind Informatics"},{"issue":"2","key":"10972_CR8","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TMM.2017.2745702","volume":"20","author":"C Hsu","year":"2018","unstructured":"Hsu C, Lin C (2018) Cnn-based joint clustering and representation learning with feature drift compensation for large-scale image data. IEEE Trans Multim 20(2):421\u2013429","journal-title":"IEEE Trans Multim"},{"issue":"5814","key":"10972_CR9","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Sci 315(5814):972\u2013976","journal-title":"Sci"},{"key":"10972_CR10","doi-asserted-by":"crossref","first-page":"102948","DOI":"10.1016\/j.dsp.2020.102948","volume":"110","author":"S Karanwal","year":"2021","unstructured":"Karanwal S, Diwakar M (2021) OD-LBP: orthogonal difference-local binary pattern for face recognition. Digit Signal Process 110:102948","journal-title":"Digit Signal Process"},{"key":"10972_CR11","doi-asserted-by":"crossref","first-page":"114264","DOI":"10.1016\/j.eswa.2020.114264","volume":"168","author":"S Singh","year":"2021","unstructured":"Singh S, Ganie AH (2021) Applications of picture fuzzy similarity measures in pattern recognition, clustering, and MADM. Expert Syst Appl 168:114264","journal-title":"Expert Syst Appl"},{"issue":"5","key":"10972_CR12","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/TKDE.2015.2503753","volume":"28","author":"D Huang","year":"2016","unstructured":"Huang D, Lai J, Wang C (2016) Robust ensemble clustering using probability trajectories. IEEE Trans Knowl Data Eng 28(5):1312\u20131326","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1\u20132","key":"10972_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s11222-014-9489-6","volume":"26","author":"E Simonnet","year":"2016","unstructured":"Simonnet E (2016) Combinatorial analysis of the adaptive last particle method. Stat Comput 26(1\u20132):211\u2013230","journal-title":"Stat Comput"},{"issue":"8","key":"10972_CR14","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1109\/TKDE.2016.2535209","volume":"28","author":"G Wang","year":"2016","unstructured":"Wang G, Song Q (2016) Automatic clustering via outward statistical testing on density metrics. IEEE Trans Knowl Data Eng 28(8):1971\u20131985","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10972_CR15","unstructured":"Ester M, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), Portland, Oregon, USA, pp. 226\u2013231. AAAI Press, ???"},{"key":"10972_CR16","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ins.2021.04.089","volume":"571","author":"M Du","year":"2021","unstructured":"Du M, Wang R, Ji R, Wang X, Zhang Y (2021) ROBP a robust border-peeling clustering using cauchy kernel. Inf Sci 571:375\u2013400","journal-title":"Inf Sci"},{"key":"10972_CR17","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A (2014) Laio, Alessandro: Clustering by fast search and find of density peaks. Sci 344:1492\u20131496","journal-title":"Sci"},{"issue":"17","key":"10972_CR18","doi-asserted-by":"crossref","first-page":"13465","DOI":"10.1007\/s00521-020-04754-5","volume":"32","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang D, Zhang X, Pang W, Miao C, Tan A, Zhou Y (2020) Mcdpc: multi-center density peak clustering. Neural Comput Appl 32(17):13465\u201313478","journal-title":"Neural Comput Appl"},{"key":"10972_CR19","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.neucom.2018.06.087","volume":"348","author":"MD Parmar","year":"2019","unstructured":"Parmar MD, Wang D, Zhang X, Tan A, Miao C, Jiang J, Zhou Y (2019) REDPC: A residual error-based density peak clustering algorithm. Neurocomputing 348:82\u201396","journal-title":"Neurocomputing"},{"key":"10972_CR20","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.neucom.2016.01.102","volume":"208","author":"R Mehmood","year":"2016","unstructured":"Mehmood R, Zhang G, Bie R, Dawood H, Ahmad H (2016) Clustering by fast search and find of density peaks via heat diffusion. Neurocomputing 208:210\u2013217","journal-title":"Neurocomputing"},{"key":"10972_CR21","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ins.2020.06.069","volume":"542","author":"S Wang","year":"2021","unstructured":"Wang S, Li Q, Zhao C, Zhu X, Yuan H, Dai T (2021) Extreme clustering - A clustering method via density extreme points. Inf Sci 542:24\u201339","journal-title":"Inf Sci"},{"key":"10972_CR22","doi-asserted-by":"crossref","first-page":"107001","DOI":"10.1016\/j.patcog.2019.107001","volume":"97","author":"Y Kim","year":"2020","unstructured":"Kim Y, Do H, Kim SB (2020) Outer-points shaver: Robust graph-based clustering via node cutting. Pattern Recognit 97:107001","journal-title":"Pattern Recognit"},{"key":"10972_CR23","doi-asserted-by":"crossref","first-page":"107449","DOI":"10.1016\/j.patcog.2020.107449","volume":"107","author":"A Lotfi","year":"2020","unstructured":"Lotfi A, Moradi P, Beigy H (2020) Density peaks clustering based on density backbone and fuzzy neighborhood. Pattern Recognit 107:107449","journal-title":"Pattern Recognit"},{"key":"10972_CR24","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J (2017) Accelerated hierarchical density based clustering. In: 2017 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 33\u201342","DOI":"10.1109\/ICDMW.2017.12"},{"issue":"7","key":"10972_CR25","volume":"32","author":"J Zhao","year":"2019","unstructured":"Zhao J, Tang J, Fan T, Li C, Xu L (2019) Density peaks clustering based on circular partition and grid similarity. Concurrency Comput practice Experience 32(7):e5567","journal-title":"Concurrency Comput practice Experience"},{"key":"10972_CR26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2018.05.034","volume":"158","author":"X Xu","year":"2018","unstructured":"Xu X, Ding S, Shi Z (2018) An improved density peaks clustering algorithm with fast finding cluster centers. Knowl Based Syst 158:65\u201374","journal-title":"Knowl Based Syst"},{"issue":"4","key":"10972_CR27","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1109\/TII.2016.2628747","volume":"13","author":"B Wu","year":"2017","unstructured":"Wu B, Wilamowski BM (2017) A fast density and grid based clustering method for data with arbitrary shapes and noise. IEEE Trans Ind Informatics 13(4):1620\u20131628","journal-title":"IEEE Trans Ind Informatics"},{"key":"10972_CR28","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.eswa.2018.07.075","volume":"115","author":"SA Seyedi","year":"2019","unstructured":"Seyedi SA, Lotfi A, Moradi P, Qader NN (2019) Dynamic graph-based label propagation for density peaks clustering. Expert Syst Appl 115:314\u2013328","journal-title":"Expert Syst Appl"},{"key":"10972_CR29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","volume":"133","author":"L Yaohui","year":"2017","unstructured":"Yaohui L, Ma Z, Fang Y (2017) Adaptive density peak clustering based on k-nearest neighbors with aggregating strategy. Knowl Based Syst 133:208\u2013220","journal-title":"Knowl Based Syst"},{"key":"10972_CR30","volume":"102","author":"H Li","year":"2020","unstructured":"Li H, Liu X, Li T, Gan R (2020) A novel density-based clustering algorithm using nearest neighbor graph. Pattern Recognit 102:107206","journal-title":"Pattern Recognit"},{"key":"10972_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107589","volume":"109","author":"MA Abbas","year":"2021","unstructured":"Abbas MA, El-Zoghabi AA, Shoukry AA (2021) Denmune: Density peak based clustering using mutual nearest neighbors. Pattern Recognit 109:107589","journal-title":"Pattern Recognit"},{"key":"10972_CR32","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.patrec.2019.10.019","volume":"128","author":"S Sieranoja","year":"2019","unstructured":"Sieranoja S, Fr\u00e4nti P (2019) Fast and general density peaks clustering. Pattern Recognit Lett 128:551\u2013558","journal-title":"Pattern Recognit Lett"},{"key":"10972_CR33","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.neucom.2021.05.071","volume":"455","author":"J Guan","year":"2021","unstructured":"Guan J, Li S, He X, Zhu J, Chen J (2021) Fast hierarchical clustering of local density peaks via an association degree transfer method. Neurocomputing 455:401\u2013418","journal-title":"Neurocomputing"},{"issue":"2","key":"10972_CR34","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1007\/s10586-017-0818-3","volume":"20","author":"X Liu","year":"2017","unstructured":"Liu X, Yang Q, He L (2017) A novel DBSCAN with entropy and probability for mixed data. Clust Comput 20(2):1313\u20131323","journal-title":"Clust Comput"},{"key":"10972_CR35","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.knosys.2017.07.027","volume":"133","author":"S Ding","year":"2017","unstructured":"Ding S, Du M, Sun T, Xu X, Xue Y (2017) An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood. Knowl Based Syst 133:294\u2013313","journal-title":"Knowl Based Syst"},{"key":"10972_CR36","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.patcog.2017.07.014","volume":"72","author":"J Sublime","year":"2017","unstructured":"Sublime J, Matei B, Cabanes G, Grozavu N, Bennani Y, Cornu\u00e9jols A (2017) Entropy based probabilistic collaborative clustering. Pattern Recognit 72:144\u2013157","journal-title":"Pattern Recognit"},{"key":"10972_CR37","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.procs.2017.11.370","volume":"122","author":"C Puri","year":"2017","unstructured":"Puri C, Kumar N (2017) An entropy based method for overlapping subspace clustering. Procedia Comput Sci 122:276\u2013283","journal-title":"Procedia Comput Sci"},{"issue":"7","key":"10972_CR38","doi-asserted-by":"crossref","first-page":"1791","DOI":"10.1109\/TPAMI.2019.2924953","volume":"42","author":"H Averbuch-Elor","year":"2020","unstructured":"Averbuch-Elor H, Bar N, Cohen-Or D (2020) Border-peeling clustering. IEEE Trans Pattern Anal Mach Intell 42(7):1791\u20131797","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"10972_CR39","first-page":"3221","volume":"15","author":"L van der Maaten","year":"2014","unstructured":"van der Maaten L (2014) Accelerating t-sne using tree-based algorithms. J Mach Learn Res 15(1):3221\u20133245","journal-title":"J Mach Learn Res"},{"key":"10972_CR40","first-page":"2837","volume":"11","author":"XV Nguyen","year":"2010","unstructured":"Nguyen XV, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. J Mach Learn Res 11:2837\u20132854","journal-title":"J Mach Learn Res"},{"key":"10972_CR41","unstructured":"Powers DMW (2020) Evaluation: from precision, recall and f-measure to roc, informedness, markedness and correlation. CoRR arxiv: 2010.16061"},{"key":"10972_CR42","unstructured":"Han J, Kamber M, Pei J (2011) Data Mining: Concepts and Techniques, 3rd Edition"},{"issue":"4","key":"10972_CR43","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1111\/j.0006-341X.2003.00125.x","volume":"59","author":"B Rosner","year":"2004","unstructured":"Rosner B, Glynn RJ, Lee MLT (2004) Incorporation of clustering effects for the wilcoxon rank sum test: A large-sample approach. Biometrics 59(4):1089\u20131098","journal-title":"Biometrics"},{"key":"10972_CR44","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.patcog.2017.08.024","volume":"73","author":"M Brbic","year":"2018","unstructured":"Brbic M, Kopriva I (2018) Multi-view low-rank sparse subspace clustering. Pattern Recognit 73:247\u2013258","journal-title":"Pattern Recognit"},{"issue":"10","key":"10972_CR45","doi-asserted-by":"crossref","first-page":"2887","DOI":"10.1109\/TCYB.2017.2751646","volume":"48","author":"K Zhan","year":"2018","unstructured":"Zhan K, Zhang C, Guan J, Wang J (2018) Graph learning for multiview clustering. IEEE Trans Cybern 48(10):2887\u20132895","journal-title":"IEEE Trans Cybern"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10972-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-022-10972-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10972-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T17:56:12Z","timestamp":1701021372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-022-10972-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10972"],"URL":"https:\/\/doi.org\/10.1007\/s11063-022-10972-w","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2022,9,7]]},"assertion":[{"value":"15 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}