{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:28:17Z","timestamp":1774466897508,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2019YFB1600500"],"award-info":[{"award-number":["2019YFB1600500"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Recently the density peaks clustering algorithm (DPC) has received a lot of attention from researchers. The DPC algorithm is able to find cluster centers and complete clustering tasks quickly. It is also suitable for different kinds of clustering tasks. However, deciding the cutoff distance\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${d}_{c}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>d<\/mml:mi>\n                            <mml:mi>c<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    largely depends on human experience which greatly affects clustering results. In addition, the selection of cluster centers requires manual participation which affects the efficiency of the algorithm. In order to solve these problems, we propose a density peaks clustering algorithm based on K nearest neighbors with adaptive merging strategy (KNN-ADPC). A clusters merging strategy is proposed to automatically aggregate over-segmented clusters. Additionally, the K nearest neighbors are adopted to divide data points more reasonably. There is only one parameter in KNN-ADPC algorithm, and the clustering task can be conducted automatically without human involvement. The experiment results on artificial and real-world datasets prove higher accuracy of KNN-ADPC compared with DBSCAN, K-means++, DPC, and DPC-KNN.\n                  <\/jats:p>","DOI":"10.1007\/s13042-021-01369-7","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T14:02:51Z","timestamp":1627999371000},"page":"2825-2841","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A novel density peaks clustering algorithm based on K nearest neighbors with adaptive merging strategy"],"prefix":"10.1007","volume":"12","author":[{"given":"Xiaoning","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3795-7263","authenticated-orcid":false,"given":"Bing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"issue":"3","key":"1369_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264\u2013323","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1369_CR2","doi-asserted-by":"publisher","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"},{"issue":"1","key":"1369_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10044-019-00783-6","volume":"23","author":"K Zhou","year":"2020","unstructured":"Zhou K, Yang S (2020) Effect of cluster size distribution on clustering: a comparative study of k-means and fuzzy c-means clustering. Pattern Anal Appl 23(1):455\u2013466","journal-title":"Pattern Anal Appl"},{"issue":"3","key":"1369_CR4","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/TNNLS.2018.2853407","volume":"30","author":"Y Cheung","year":"2018","unstructured":"Cheung Y, Zhang Y (2018) Fast and accurate hierarchical clustering based on growing multilayer topology training. IEEE Trans Neural Netw Learn Syst 30(3):876\u2013890","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1369_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ins.2016.09.032","volume":"374","author":"H Jia","year":"2016","unstructured":"Jia H, Ding S, Du M, Xue Y (2016) Approximate normalized cuts without Eigen-decomposition.\u00a0Inf Sci\u00a0374:135\u2013150","journal-title":"Inf Sci"},{"key":"1369_CR6","doi-asserted-by":"publisher","first-page":"113513","DOI":"10.1016\/j.eswa.2020.113513","volume":"159","author":"H Lu","year":"2020","unstructured":"Lu H, Liu S, Wei H et al (2020) Multi-kernel fuzzy clustering based on auto-encoder for fMRI functional network. Expert Syst Appl 159:113513","journal-title":"Expert Syst Appl"},{"key":"1369_CR7","doi-asserted-by":"crossref","unstructured":"Chen MS, Huang L, Wang CD et al (2020) Multi-view clustering in latent embedding space. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, no 04, pp 3513\u20133520","DOI":"10.1609\/aaai.v34i04.5756"},{"key":"1369_CR8","unstructured":"Ji P, Zhang T, Li H et al (2017) Deep subspace clustering networks. arXiv:1709.02508"},{"issue":"6","key":"1369_CR9","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2019.2903410","volume":"32","author":"D Huang","year":"2019","unstructured":"Huang D, Wang CD, Wu JS et al (2019) Ultra-scalable spectral clustering and ensemble clustering[J]. IEEE Trans Knowl Data Eng 32(6):1212\u20131226","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1369_CR10","unstructured":"Xie J, Girshick R, Farhadi A (2016) Unsupervised deep embedding for clustering analysis. In: International conference on machine learning, pp 478\u2013487"},{"key":"1369_CR11","unstructured":"Xu J, Lange K (2019) Power k-means clustering. In: International conference on machine learning. PMLR, pp 6921\u20136931"},{"issue":"34","key":"1369_CR12","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96(34):226\u2013231","journal-title":"KDD"},{"key":"1369_CR13","unstructured":"David A, Sergei V (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7\u20139, 2007. ACM, 2007"},{"issue":"6191","key":"1369_CR14","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"},{"key":"1369_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2016.03.011","volume":"354","author":"J Xie","year":"2016","unstructured":"Xie J, Gao H, Xie W et al (2016) Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors. Inf Sci 354:19\u201340","journal-title":"Inf Sci"},{"key":"1369_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.patcog.2017.06.023","volume":"71","author":"L Bai","year":"2017","unstructured":"Bai L, Cheng X, Liang J et al (2017) Fast density clustering strategies based on the k-means algorithm. Pattern Recognit 71:375\u2013386","journal-title":"Pattern Recognit"},{"key":"1369_CR17","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","journal-title":"Inf Sci"},{"key":"1369_CR18","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.physa.2019.03.012","volume":"523","author":"J Jiang","year":"2019","unstructured":"Jiang J, Chen Y, Meng X et al (2019) A novel density peaks clustering algorithm based on k nearest neighbors for improving assignment process. Phys A 523:702\u2013713","journal-title":"Phys A"},{"key":"1369_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","volume":"133","author":"L Yaohui","year":"2017","unstructured":"Yaohui L, Zhengming M, 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":"1369_CR20","doi-asserted-by":"crossref","unstructured":"Jain AK, Law MHC (2005) Data clustering: a user\u2019s dilemma. In: International conference on pattern recognition and machine intelligence. Springer, Berlin, pp 1\u201310","DOI":"10.1007\/11590316_1"},{"key":"1369_CR21","doi-asserted-by":"publisher","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 et al (2019) Dynamic graph-based label propagation for density peaks clustering. Expert Syst Appl 115:314\u2013328","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1369_CR22","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10115-018-1189-7","volume":"59","author":"M Du","year":"2019","unstructured":"Du M, Ding S, Xue Y et al (2019) A novel density peaks clustering with sensitivity of local density and density-adaptive metric. Knowl Inf Syst 59(2):285\u2013309","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1369_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2105-8-3","volume":"8","author":"L Fu","year":"2007","unstructured":"Fu L, Medico E (2007) FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data. BMC Bioinform 8(1):3","journal-title":"BMC Bioinform"},{"issue":"1","key":"1369_CR24","doi-asserted-by":"publisher","first-page":"4-es","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. ACM Trans Knowl Discov Data 1(1):4-es","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1","key":"1369_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang H, Yeung DY (2008) Robust path-based spectral clustering. Pattern Recognit 41(1):191\u2013203","journal-title":"Pattern Recognit"},{"issue":"9","key":"1369_CR26","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","volume":"24","author":"CJ Veenman","year":"2002","unstructured":"Veenman CJ, Reinders MJT, Backer E (2002) A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell 24(9):1273\u20131280","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1369_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2019.04.001","volume":"84","author":"QZ Dai","year":"2019","unstructured":"Dai QZ, Xiong ZY, Xie J et al (2019) A novel clustering algorithm based on the natural reverse nearest neighbor structure. Inf Syst 84:1\u201316","journal-title":"Inf Syst"},{"issue":"1","key":"1369_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TFUZZ.2018.2869125","volume":"27","author":"Z Su","year":"2018","unstructured":"Su Z, Denoeux T (2018) BPEC: belief-peaks evidential clustering. IEEE Trans Fuzzy Syst 27(1):111\u2013123","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1369_CR29","unstructured":"Dua D, Karra Taniskidou E (2017) UCI machine learning repository. University of California. School of Information and Computer Science, Irvine, CA. Available at http:\/\/archive.ics.uci.edu\/ml. Accessed 21 Apr 2019"},{"issue":"5","key":"1369_CR30","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BF02520002","volume":"34","author":"J Jossinet","year":"1996","unstructured":"Jossinet J (1996) Variability of impedivity in normal and pathological breast tissue. Med Biol Eng Comput 34(5):346\u2013350","journal-title":"Med Biol Eng Comput"},{"key":"1369_CR31","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, 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"},{"issue":"383","key":"1369_CR32","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes EB, Mallows CL (1983) A method for comparing two hierarchical clusterings. J Am Stat Assoc 78(383):553\u2013569","journal-title":"J Am Stat Assoc"},{"issue":"12","key":"1369_CR33","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.patcog.2005.01.012","volume":"38","author":"A Jain","year":"2005","unstructured":"Jain A, Nandakumar K, Ross A (2005) Score normalization in multimodal biometric systems. Pattern Recognit 38(12):2270\u20132285","journal-title":"Pattern Recognit"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01369-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-021-01369-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01369-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T01:18:46Z","timestamp":1629595126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-021-01369-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":33,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1369"],"URL":"https:\/\/doi.org\/10.1007\/s13042-021-01369-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-95747\/v1","asserted-by":"object"}]},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"21 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}