{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:50:00Z","timestamp":1770900600119,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"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 Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076015"],"award-info":[{"award-number":["62076015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10115-024-02272-7","type":"journal-article","created":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T06:38:27Z","timestamp":1731134307000},"page":"1573-1596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving density peak clustering on multi-dimensional time series: rediscover and subdivide"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9798-0145","authenticated-orcid":false,"given":"Huina","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaipu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangzhi","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,9]]},"reference":[{"issue":"3","key":"2272_CR1","doi-asserted-by":"publisher","first-page":"631","DOI":"10.13328\/j.cnki.jos.005155","volume":"28","author":"S Qiao","year":"2017","unstructured":"Qiao S, Han N, Zhang K-F, Zou L, Wang H, Gutierrez L (2017) Algorithm for detecting overlapping communities from complex network big data. Journal of Software 28(3):631\u2013647. https:\/\/doi.org\/10.13328\/j.cnki.jos.005155","journal-title":"Journal of Software"},{"key":"2272_CR2","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun AM, Ezugwu AE, Abualigah L, Abuhaija B, Heming J (2023) K-means clustering algorithms: a comprehensive review, variants analysis, and advances in the era of big data. Inf Sci 622:178\u2013210","journal-title":"Inf Sci"},{"key":"2272_CR3","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1007\/s10115-018-1278-7","volume":"61","author":"VHA Soares","year":"2019","unstructured":"Soares VHA, Campello RJ, Nourashrafeddin S, Milios E, Naldi MC (2019) Combining semantic and term frequency similarities for text clustering. Knowl Inf Syst 61:1485\u20131516. https:\/\/doi.org\/10.1007\/s10115-018-1278-7","journal-title":"Knowl Inf Syst"},{"key":"2272_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10115-017-1110-9","volume":"56","author":"J Hu","year":"2018","unstructured":"Hu J, Pei J (2018) Subspace multi-clustering: a review. Knowl Inf Syst 56:257\u2013284. https:\/\/doi.org\/10.1007\/s10115-017-1110-9","journal-title":"Knowl Inf Syst"},{"key":"2272_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.inffus.2022.12.008","volume":"92","author":"L Guo","year":"2023","unstructured":"Guo L, Shi P, Chen L, Chen C, Ding W (2023) Pixel and region level information fusion in membership regularized fuzzy clustering for image segmentation. Inf Fusion 92:479\u2013497","journal-title":"Inf Fusion"},{"issue":"23","key":"2272_CR6","doi-asserted-by":"publisher","first-page":"35493","DOI":"10.1007\/s11042-023-14861-9","volume":"82","author":"B Sasmal","year":"2023","unstructured":"Sasmal B, Dhal KG (2023) A survey on the utilization of Superpixel image for clustering based image segmentation. Multimed Tools Appl 82(23):35493\u201335555","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"2272_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1111\/coin.12297","volume":"39","author":"N Dhanachandra","year":"2023","unstructured":"Dhanachandra N, Chanu YJ, Singh KM (2023) A new hybrid image segmentation approach using clustering and black hole algorithm. Comput Intell 39(2):194\u2013213","journal-title":"Comput Intell"},{"key":"2272_CR8","doi-asserted-by":"publisher","first-page":"106071","DOI":"10.1016\/j.engappai.2023.106071","volume":"122","author":"SM Dol","year":"2023","unstructured":"Dol SM, Jawandhiya PM (2023) Classification technique and its combination with clustering and association rule mining in educational data mining\u2014a survey. Eng Appl Artif Intell 122:106071","journal-title":"Eng Appl Artif Intell"},{"key":"2272_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-1-4471-7503-2_38","volume-title":"Springer handbook of engineering statistics","author":"K-L Tsui","year":"2023","unstructured":"Tsui K-L, Chen V, Jiang W, Yang F, Kan C (2023) Data mining methods and applications. In: Pham H (ed) Springer handbook of engineering statistics. Springer, London, pp 797\u2013816"},{"key":"2272_CR10","doi-asserted-by":"publisher","first-page":"35001","DOI":"10.1007\/s11042-021-10594-9","volume":"81","author":"H Mittal","year":"2022","unstructured":"Mittal H, Pandey AC, Saraswat M, Kumar S, Pal R, Modwel G (2022) A comprehensive survey of image segmentation: clustering methods, performance parameters, and benchmark datasets. Multimed Tools Appl 81:35001\u201335026","journal-title":"Multimed Tools Appl"},{"issue":"12","key":"2272_CR11","doi-asserted-by":"publisher","first-page":"6965","DOI":"10.1007\/s00521-020-05471-9","volume":"33","author":"K Chowdhury","year":"2021","unstructured":"Chowdhury K, Chaudhuri D, Pal AK (2021) An entropy-based initialization method of K-means clustering on the optimal number of clusters. Neural Comput Appl 33(12):6965\u20136982","journal-title":"Neural Comput Appl"},{"key":"2272_CR12","doi-asserted-by":"publisher","first-page":"107996","DOI":"10.1016\/j.patcog.2021.107996","volume":"117","author":"S Huang","year":"2021","unstructured":"Huang S, Kang Z, Xu Z, Liu Q (2021) Robust deep k-means: an effective and simple method for data clustering. Pattern Recogn 117:107996","journal-title":"Pattern Recogn"},{"key":"2272_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/s00357-015-9182-2","volume":"32","author":"C Panagiotakis","year":"2015","unstructured":"Panagiotakis C (2015) Point clustering via voting maximization. J Classif 32:212\u2013240","journal-title":"J Classif"},{"key":"2272_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2018.09.006","volume":"118","author":"SF Hussain","year":"2019","unstructured":"Hussain SF, Haris M (2019) A k-means based co-clustering (kCC) algorithm for sparse, high dimensional data. Expert Syst Appl 118:20\u201334","journal-title":"Expert Syst Appl"},{"issue":"8","key":"2272_CR15","doi-asserted-by":"publisher","first-page":"8219","DOI":"10.1007\/s10462-022-10366-3","volume":"56","author":"X Ran","year":"2023","unstructured":"Ran X, Xi Y, Lu Y, Wang X, Lu Z (2023) Comprehensive survey on hierarchical clustering algorithms and the recent developments. Artif Intell Rev 56(8):8219\u20138264","journal-title":"Artif Intell Rev"},{"key":"2272_CR16","doi-asserted-by":"publisher","first-page":"109255","DOI":"10.1016\/j.patcog.2022.109255","volume":"136","author":"Q Huang","year":"2023","unstructured":"Huang Q, Gao R, Akhavan H (2023) An ensemble hierarchical clustering algorithm based on merits at cluster and partition levels. Pattern Recogn 136:109255","journal-title":"Pattern Recogn"},{"issue":"8","key":"2272_CR17","first-page":"9153","volume":"37","author":"Q Meng","year":"2023","unstructured":"Meng Q, Qian H, Liu Y, Cui L, Xu Y, Shen Z (2023) MHCCL: masked hierarchical cluster-wise contrastive learning for multivariate time series. Proc AAAI Conf Artif Intell 37(8):9153\u20139161","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2272_CR18","doi-asserted-by":"publisher","first-page":"109341","DOI":"10.1016\/j.patcog.2023.109341","volume":"137","author":"R Maheshwari","year":"2023","unstructured":"Maheshwari R, Mohanty SK, Mishra AC (2023) DCSNE: Density-based clustering using graph shared neighbors and entropy. Pattern Recogn 137:109341","journal-title":"Pattern Recogn"},{"key":"2272_CR19","first-page":"1","volume":"15","author":"P Bhattacharjee","year":"2021","unstructured":"Bhattacharjee P, Mitra P (2021) A survey of density based clustering algorithms. Front Comp Sci 15:1\u201327","journal-title":"Front Comp Sci"},{"issue":"5","key":"2272_CR20","doi-asserted-by":"publisher","first-page":"4767","DOI":"10.1109\/TKDE.2022.3150403","volume":"35","author":"T Qiu","year":"2023","unstructured":"Qiu T, Li Y-J (2023) Fast LDP-MST: an efficient density-peak-based clustering method for large-size datasets. IEEE Trans Knowl Data Eng 35(5):4767\u20134780","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"2272_CR21","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1109\/TSMC.2021.3049490","volume":"52","author":"D Cheng","year":"2021","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 Trans Syst, Man Cybern: Syst 52(4):2348\u20132360","journal-title":"IEEE Trans Syst, Man Cybern: Syst"},{"issue":"3","key":"2272_CR22","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1109\/TCYB.2019.2916196","volume":"51","author":"Y Lu","year":"2019","unstructured":"Lu Y, Cheung Y-M, Tang YY (2019) Self-adaptive multiprototype-based competitive learning approach: a k-means-type algorithm for imbalanced data clustering. IEEE Trans Cybern 51(3):1598\u20131612. https:\/\/doi.org\/10.1109\/TCYB.2019.2916196","journal-title":"IEEE Trans Cybern"},{"key":"2272_CR23","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) Density-based spatial clustering of applications with noise. In: International Conference Knowledge Discovery and Data Mining 240: 6"},{"issue":"6191","key":"2272_CR24","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. https:\/\/doi.org\/10.1126\/science.1242072","journal-title":"Science"},{"issue":"1","key":"2272_CR25","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Expl Newsl 6(1):90\u2013105. https:\/\/doi.org\/10.1145\/1007730.1007731","journal-title":"ACM SIGKDD Expl Newsl"},{"key":"2272_CR26","doi-asserted-by":"publisher","first-page":"104824","DOI":"10.1016\/j.knosys.2019.06.032","volume":"187","author":"Y Chen","year":"2020","unstructured":"Chen Y et al (2020) Fast density peak clustering for large scale data based on kNN. Knowl-Based Syst 187:104824. https:\/\/doi.org\/10.1016\/j.knosys.2019.06.032","journal-title":"Knowl-Based Syst"},{"key":"2272_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","volume":"450","author":"R Liu","year":"2018","unstructured":"Liu R, Wang H, Yu X (2018) Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci 450:200\u2013226. https:\/\/doi.org\/10.1016\/j.ins.2018.03.031","journal-title":"Inf Sci"},{"issue":"7","key":"2272_CR28","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s13042-017-0636-1","volume":"9","author":"M Du","year":"2018","unstructured":"Du M, Ding S, Xue Y (2018) A robust density peaks clustering algorithm using fuzzy neighborhood. Int J Mach Learn Cybern 9(7):1131\u20131140. https:\/\/doi.org\/10.1007\/s13042-017-0636-1","journal-title":"Int J Mach Learn Cybern"},{"key":"2272_CR29","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.01.013","volume":"436","author":"Y-A Geng","year":"2018","unstructured":"Geng Y-A, Li Q, Zheng R, Zhuang F, He R, Xiong N (2018) RECOME: a new density-based clustering algorithm using relative KNN kernel density. Inf Sci 436:13\u201330. https:\/\/doi.org\/10.1016\/j.ins.2018.01.013","journal-title":"Inf Sci"},{"key":"2272_CR30","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.ins.2022.11.091","volume":"621","author":"Y Wang","year":"2023","unstructured":"Wang Y, Wang D, Zhou Y, Zhang X, Quek C (2023) VDPC: variational density peak clustering algorithm. Inf Sci 621:627\u2013651","journal-title":"Inf Sci"},{"key":"2272_CR31","doi-asserted-by":"publisher","first-page":"88200","DOI":"10.1109\/ACCESS.2020.2992903","volume":"8","author":"J Cai","year":"2020","unstructured":"Cai J, Wei H, Yang H, Zhao X (2020) A novel clustering algorithm based on DPC and PSO. IEEE Access 8:88200\u201388214","journal-title":"IEEE Access"},{"issue":"3","key":"2272_CR32","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/TII.2017.2684807","volume":"13","author":"Q Zhang","year":"2017","unstructured":"Zhang Q, Zhu C, Yang LT, Chen Z, Zhao L, Li P (2017) An incremental CFS algorithm for clustering large data in industrial Internet of Things. IEEE Trans Industr Inf 13(3):1193\u20131201. https:\/\/doi.org\/10.1109\/TII.2017.2684807","journal-title":"IEEE Trans Industr Inf"},{"issue":"5","key":"2272_CR33","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1109\/TCYB.2017.2695218","volume":"48","author":"Z Wang","year":"2017","unstructured":"Wang Z et al (2017) Clustering by local gravitation. IEEE Trans Cybern 48(5):1383\u20131396. https:\/\/doi.org\/10.1109\/TCYB.2017.2695218","journal-title":"IEEE Trans Cybern"},{"key":"2272_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.physa.2018.09.002","volume":"514","author":"J Jiang","year":"2019","unstructured":"Jiang J, Chen Y, Hao D, Li K (2019) DPC-LG: density peaks clustering based on logistic distribution and gravitation. Phys A Stat Mech Appl 514:25\u201335. https:\/\/doi.org\/10.1016\/j.physa.2018.09.002","journal-title":"Phys A Stat Mech Appl"},{"issue":"2","key":"2272_CR35","doi-asserted-by":"publisher","first-page":"238","DOI":"10.3390\/app9020238","volume":"9","author":"Y Yang","year":"2019","unstructured":"Yang Y, Zheng K, Wu C, Niu X, Yang Y (2019) Building an effective intrusion detection system using the modified density peak clustering algorithm and deep belief networks. Appl Sci 9(2):238. https:\/\/doi.org\/10.3390\/app9020238","journal-title":"Appl Sci"},{"issue":"5","key":"2272_CR36","doi-asserted-by":"publisher","first-page":"4476","DOI":"10.1109\/JSEN.2022.3185736","volume":"23","author":"Z Wang","year":"2022","unstructured":"Wang Z, Jiang Y, Huang J, Wang B, Ji H, Huang Z (2022) A new image reconstruction algorithm for CCERT based on improved DPC and K-means. IEEE Sens J 23(5):4476\u20134485","journal-title":"IEEE Sens J"},{"key":"2272_CR37","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","volume":"99","author":"M Du","year":"2016","unstructured":"Du M, Ding S, Jia H (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl-Based Syst 99:135\u2013145. https:\/\/doi.org\/10.1016\/j.knosys.2016.02.001","journal-title":"Knowl-Based Syst"},{"key":"2272_CR38","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.knosys.2018.05.034","journal-title":"Knowl-Based Syst"},{"key":"2272_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204","author":"W Li","year":"2019","unstructured":"Li W et al (2019) Approximate nearest neighbor search on high dimensional data-experiments, analyses, and improvement. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2019.2909204","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"2272_CR40","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2019","unstructured":"Li W et al (2019) Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement. IEEE Trans Knowl Data Eng 32(8):1475\u20131488. https:\/\/doi.org\/10.1109\/TKDE.2019.2909204","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"2272_CR41","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov YA, Yashunin DA (2018) Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans Pattern Anal Mach Intell 42(4):824\u2013836. https:\/\/doi.org\/10.1109\/TPAMI.2018.2889473","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2272_CR42","doi-asserted-by":"publisher","first-page":"101374","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller M, Bernhardsson E, Faithfull A (2020) ANN-Benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf Syst 87:101374. https:\/\/doi.org\/10.1016\/j.is.2019.02.006","journal-title":"Inf Syst"},{"key":"2272_CR43","unstructured":"Liu T, Moore AW, Yang K, Gray AG (2005) An investigation of practical approximate nearest neighbor algorithms. Adv Neural Inf Process Syst pp. 825\u2013832."},{"issue":"19","key":"2272_CR44","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1016\/j.fss.2007.04.023","volume":"158","author":"M Sarkar","year":"2007","unstructured":"Sarkar M (2007) Fuzzy-rough nearest neighbor algorithms in classification. Fuzzy Sets Syst 158(19):2134\u20132152. https:\/\/doi.org\/10.1016\/j.fss.2007.04.023","journal-title":"Fuzzy Sets Syst"},{"issue":"11","key":"2272_CR45","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja M, Lowe DG (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans Pattern Anal Mach Intell 36(11):2227\u20132240. https:\/\/doi.org\/10.1109\/TPAMI.2014.2321376","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"2272_CR46","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant A, Cios K (2018) RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans Knowl Data Eng 30(6):1109\u20131121. https:\/\/doi.org\/10.1109\/TKDE.2017.2787640","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"2272_CR47","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517. https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun ACM"},{"key":"2272_CR48","unstructured":"Omohundro SM (1989) Five balltree construction algorithms. International Computer Science Institute, Berkeley"},{"key":"2272_CR49","volume-title":"Cluster analysis for researchers","author":"C Romesburg","year":"2004","unstructured":"Romesburg C (2004) Cluster analysis for researchers. Lulu Press, Morrisville"},{"issue":"1","key":"2272_CR50","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TIT.1975.1055330","volume":"21","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga K, Hostetler L (1975) The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Trans Inf Theory 21(1):32\u201340","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"2272_CR51","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"},{"key":"2272_CR52","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1201\/9781315373515-8","volume-title":"Data clustering: algorithms and applications","author":"J Liu","year":"2018","unstructured":"Liu J, Han J (2018) Spectral clustering. In: Aggarwal CC, Reddy CK (eds) Data clustering: algorithms and applications. Chapman and Hall\/CRC, London, pp 177\u2013200"},{"key":"2272_CR53","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Courier Corporation, North Chelmsford"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02272-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02272-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02272-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T13:49:11Z","timestamp":1738331351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02272-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,9]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2272"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02272-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,9]]},"assertion":[{"value":"6 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study did not involve human or animal subjects, and thus, no ethical approval was required.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}