{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T07:06:26Z","timestamp":1782457586127,"version":"3.54.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972179"],"award-info":[{"award-number":["61972179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2021B1515120048"],"award-info":[{"award-number":["2021B1515120048"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2020A1515011476"],"award-info":[{"award-number":["2020A1515011476"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11227-022-04456-w","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T15:03:37Z","timestamp":1649257417000},"page":"14597-14625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An improvement of spectral clustering algorithm based on fast diffusion search for natural neighbor and affinity propagation"],"prefix":"10.1007","volume":"78","author":[{"given":"Qifen","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-0301","authenticated-orcid":false,"given":"Ziyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wanyi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuhua","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaotian","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhui","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"4456_CR1","unstructured":"MacQueen J et\u00a0al (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, pp 281\u2013297. Oakland, CA, USA"},{"key":"4456_CR2","unstructured":"Arthur D, Vassilvitskii S (2006) k-means++: The advantages of careful seeding. Technical report, Stanford"},{"key":"4456_CR3","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X, et\u00a0al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd, pp 226\u2013231"},{"issue":"6191","key":"4456_CR4","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"issue":"2","key":"4456_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) Birch: an efficient data clustering method for very large databases. ACM SIGMOD Rec 25(2):103\u2013114","journal-title":"ACM SIGMOD Rec"},{"issue":"2","key":"4456_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha S, Rastogi R, Shim K (1998) Cure: an efficient clustering algorithm for large databases. ACM SIGMOD Rec 27(2):73\u201384","journal-title":"ACM SIGMOD Rec"},{"issue":"2\u20133","key":"4456_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek JC, Ehrlich R, Full W (1984) Fcm: the fuzzy c-means clustering algorithm. Comput Geosci 10(2\u20133):191\u2013203","journal-title":"Comput Geosci"},{"issue":"8","key":"4456_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4456_CR9","unstructured":"Ng Andrew\u00a0Y, Jordan Michael\u00a0I, Weiss Y(2002) On spectral clustering: Analysis and an algorithm. In: Advances in neural information processing systems, pp 849\u2013856"},{"key":"4456_CR10","unstructured":"Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. In: advances in neural information processing systems (NIPS)"},{"issue":"9","key":"4456_CR11","first-page":"1876","volume":"32","author":"X-Y Liu","year":"2011","unstructured":"Liu X-Y, Li J-W, Hong Yu, You Q-Z, Lin H-F (2011) Adaptive spectral clustering based on shared nearest neighbors. J Chinese Comput Syst 32(9):1876\u20131880","journal-title":"J Chinese Comput Syst"},{"key":"4456_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Feng J, Huang J (2016) Natural neighbor: a self-adaptive neighborhood method without parameter k. Pattern Recogn Lett 80:30\u201336","journal-title":"Pattern Recogn Lett"},{"key":"4456_CR13","doi-asserted-by":"crossref","unstructured":"Yuan CY, Zhang LS (2020) Spectral averagely-dense clustering based on dynamic shared nearest neighbors. In: 2020 5th International Conference on Computational Intelligence and Applications (ICCIA), pp 138\u2013144. IEEE","DOI":"10.1109\/ICCIA49625.2020.00034"},{"issue":"3","key":"4456_CR14","first-page":"238","volume":"57","author":"E Fix","year":"1989","unstructured":"Fix E, Hodges JL (1989) Discriminatory analysis. nonparametric discrimination: consistency properties. International Statistical Review\/Revue Internationale de Statistique 57(3):238\u2013247","journal-title":"International Statistical Review\/Revue Internationale de Statistique"},{"key":"4456_CR15","doi-asserted-by":"crossref","unstructured":"Zou Xian\u00a0L, Zhu Qing\u00a0S, Yang Rui\u00a0L(2011) Natural nearest neighbor for isomap algorithm without free-parameter. In: Advanced Materials Research, pp 994\u2013998. Trans Tech Publ","DOI":"10.4028\/www.scientific.net\/AMR.219-220.994"},{"key":"4456_CR16","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.knosys.2017.02.027","volume":"123","author":"D Cheng","year":"2017","unstructured":"Cheng D, Zhu Q, Huang J, Yang L, Quanwang W (2017) Natural neighbor-based clustering algorithm with local representatives. Knowl-Based Syst 123:238\u2013253","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"4456_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1162\/neco.1989.1.3.295","volume":"1","author":"HB Barlow","year":"1989","unstructured":"Barlow HB (1989) Unsupervised learning. Neural Comput 1(3):295\u2013311","journal-title":"Neural Comput"},{"issue":"2","key":"4456_CR18","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23(2):298\u2013305","journal-title":"Czechoslov Math J"},{"issue":"2","key":"4456_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10878-010-9351-5","volume":"23","author":"N Fan","year":"2012","unstructured":"Fan N, Pardalos PM (2012) Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs. J Comb Optim 23(2):224\u2013251","journal-title":"J Comb Optim"},{"key":"4456_CR20","doi-asserted-by":"crossref","unstructured":"Alpert Charles\u00a0J, Yao S-Z (1995) Spectral partitioning: The more eigenvectors, the better. In: Proceedings of the 32nd Annual ACM\/IEEE Design Automation Conference, pp 195\u2013200","DOI":"10.1145\/217474.217529"},{"key":"4456_CR21","unstructured":"Chung Fan\u00a0RK, Graham FC (1997) Spectral graph theory. Number\u00a092. American Mathematical Soc"},{"issue":"5814","key":"4456_CR22","doi-asserted-by":"publisher","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. Science 315(5814):972\u2013976","journal-title":"Science"},{"key":"4456_CR23","unstructured":"Meimei G (2019) Research on spectral clustering algorithm based on nearest neighbor graph analysis. PhD thesis, Shaanxi Normal University"},{"key":"4456_CR24","doi-asserted-by":"crossref","unstructured":"G\u00fczel Kadir, Kur\u015fun Olcay (2015) Improving spectral clustering using path-based connectivity. In: 2015 23nd Signal Processing and Communications Applications Conference (SIU), pp 2110\u20132113. IEEE","DOI":"10.1109\/SIU.2015.7130288"},{"issue":"2","key":"4456_CR25","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","volume":"33","author":"D Cheng","year":"2019","unstructured":"Cheng D, Zhu Q, Huang J, Quanwang W, Yang L (2019) Clustering with local density peaks-based minimum spanning tree. IEEE Trans Knowl Data Eng 33(2):374\u2013387","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4456_CR26","doi-asserted-by":"crossref","unstructured":"Cheng D, Huang J, Zhang S, Zhang X, Luo X (2021) A novel approximate spectral clustering algorithm with dense cores and density peaks. IEEE transactions on systems, man, and cybernetics: systems, (2021)","DOI":"10.1109\/TSMC.2021.3049490"},{"issue":"5","key":"4456_CR27","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/s13042-020-01231-2","volume":"12","author":"L Wang","year":"2021","unstructured":"Wang L, Ding S, Wang Y, Ding L (2021) A robust spectral clustering algorithm based on grid-partition and decision-graph. Int J Mach Learn Cybern 12(5):1243\u20131254","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"4456_CR28","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1007\/s13042-020-01236-x","volume":"12","author":"Y Wang","year":"2021","unstructured":"Wang Y, Ding S, Wang L, Ding L (2021) An improved density-based adaptive p-spectral clustering algorithm. Int J Mach Learn Cybern 12(6):1571\u20131582","journal-title":"Int J Mach Learn Cybern"},{"key":"4456_CR29","doi-asserted-by":"publisher","first-page":"101054","DOI":"10.1109\/ACCESS.2019.2929948","volume":"7","author":"L Wang","year":"2019","unstructured":"Wang L, Ding S, Jia H (2019) An improvement of spectral clustering via message passing and density sensitive similarity. IEEE Access 7:101054\u2013101062","journal-title":"IEEE Access"},{"key":"4456_CR30","unstructured":"Givoni I, Frey B (2009) Semi-supervised affinity propagation with instance-level constraints. In: Artificial intelligence and statistics, pp 161\u2013168. PMLR"},{"key":"4456_CR31","doi-asserted-by":"crossref","unstructured":"Jia H, Wang L, Song H, Mao Q, Ding S (2018) A k-ap clustering algorithm basedon manifold similarity measure. In: International Conference on Intelligent Information Processing, pp 20\u201329. Springer","DOI":"10.1007\/978-3-030-00828-4_3"},{"issue":"Dec","key":"4456_CR32","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3(Dec):583\u2013617","journal-title":"J Mach Learn Res"},{"issue":"336","key":"4456_CR33","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"4456_CR34","unstructured":"Ertoz L, Steinbach M, Kumar V (2002) A new shared nearest neighbor clustering algorithm and its applications. In: Workshop on Clustering High Dimensional Data and its Applications at 2nd SIAM International Conference on Data Mining, volume\u00a08"},{"key":"4456_CR35","unstructured":"Samaria FS, Harter AC (1994) Parameterisation of a stochastic model for human face identification. In: Proceedings of 1994 IEEE workshop on applications of computer vision, pp 138\u2013142. IEEE"}],"updated-by":[{"DOI":"10.1007\/s11227-022-04743-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04456-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04456-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04456-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T06:09:44Z","timestamp":1661407784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04456-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4456"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04456-w","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11227-022-04743-6","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,6]]},"assertion":[{"value":"7 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2022","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11227-022-04743-6","URL":"https:\/\/doi.org\/10.1007\/s11227-022-04743-6","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}