{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:13:50Z","timestamp":1777457630680,"version":"3.51.4"},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"vor","delay-in-days":198,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1435215"],"award-info":[{"award-number":["U1435215"]}],"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":["61433012"],"award-info":[{"award-number":["61433012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Clustering aims to differentiate objects from different groups (clusters) by similarities or distances between pairs of objects. Numerous clustering algorithms have been proposed to investigate what factors constitute a cluster and how to efficiently find them. The clustering by fast search and find of density peak algorithm is proposed to intuitively determine cluster centers and assign points to corresponding partitions for complex datasets. This method incorporates simple structure due to the noniterative logic and less few parameters; however, the guidelines for parameter selection and center determination are not explicit. To tackle these problems, we propose an improved hierarchical clustering method HCDP aiming to represent the complex structure of the dataset. A <jats:italic>k<\/jats:italic>\u2010nearest neighbor strategy is integrated to compute the local density of each point, avoiding to select the nonnecessary global parameter <jats:italic>d<\/jats:italic><jats:sub>c<\/jats:sub> and enables cluster smoothing and condensing. In addition, a new clustering evaluation approach is also introduced to extract a \u201cflat\u201d and \u201coptimal\u201d partition solution from the structure by adaptively computing the clustering stability. The proposed approach is conducted on some applications with complex datasets, where the results demonstrate that the novel method outperforms its counterparts to a large extent.<\/jats:p>","DOI":"10.1155\/2018\/2032461","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T23:43:18Z","timestamp":1531957398000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Novel Hierarchical Clustering Algorithm Based on Density Peaks for Complex Datasets"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8527-0020","authenticated-orcid":false,"given":"Rong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8730-3711","authenticated-orcid":false,"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengzhong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nurbol","family":"Luktarhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.01.102"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS799"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.071"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.011"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.02.001"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.010"},{"key":"e_1_2_8_8_2","unstructured":"Courjault-Rad\u00e9V. D\u2019EstampesL. andPuechmorelS. Improved Density Peak Clustering for Large Datasets 2016 working paper or preprint."},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1177\/0962280215609948"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep45602"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.04.031"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"ZhouR. ZhangS. ChenC. NingL. ZhangY. FengS. LiuY. andLuktarhanN. A distance and density-based clustering algorithm using automatic peak detection 2016 IEEE International Conference on Smart Cloud (SmartCloud) November 2016 New York NY USA 176\u2013183 https:\/\/doi.org\/10.1109\/SmartCloud.2016.39 2-s2.0-85011085707.","DOI":"10.1109\/SmartCloud.2016.39"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.01.009"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.086"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1428-6_3752"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"e_1_2_8_17_2","volume-title":"Algorithms for Clustering Data","author":"Jain A. K.","year":"1988"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"},{"key":"e_1_2_8_19_2","doi-asserted-by":"crossref","unstructured":"AnkerstM. BreunigM. M. KriegelH.-P. andSanderJ. OPTICS: ordering points to identify the clustering structure Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD \u203299 June 1999 New York NY USA 49\u201360 https:\/\/doi.org\/10.1145\/304181.304187.","DOI":"10.1145\/304181.304187"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.32"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00103-9"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700079"},{"key":"e_1_2_8_24_2","doi-asserted-by":"crossref","unstructured":"AksehirliE. GoethalsB. M\u00fcllerE. andVreekenJ. Cartification: a neighborhood preserving transformation for mining high dimensional data 2013 IEEE 13th International Conference on Data Mining December 2013 Dallas TX USA 937\u2013942 https:\/\/doi.org\/10.1109\/ICDM.2013.146 2-s2.0-84894652517.","DOI":"10.1109\/ICDM.2013.146"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/t-c.1973.223640"},{"key":"e_1_2_8_26_2","doi-asserted-by":"crossref","unstructured":"SchneiderJ.andVlachosM. Fast parameterless density-based clustering via random projections Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM \u203213 October-November 2013 New York NY USA 861\u2013866 https:\/\/doi.org\/10.1145\/2505515.2505590 2-s2.0-84889575144.","DOI":"10.1145\/2505515.2505590"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_8_28_2","volume-title":"Five Balltree Construction Algorithms","author":"Omohundro S. M.","year":"1989"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1987.10478428"},{"key":"e_1_2_8_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0120-3"},{"key":"e_1_2_8_31_2","doi-asserted-by":"publisher","DOI":"10.1198\/jcgs.2009.07049"},{"key":"e_1_2_8_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217303"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.04.010"},{"key":"e_1_2_8_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13105-9_2"},{"key":"e_1_2_8_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054809"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1180040210"},{"key":"e_1_2_8_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3835(94)90099-X"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/2032461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/2032461.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/2032461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T22:55:12Z","timestamp":1723157712000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/2032461"}},"subtitle":[],"editor":[{"given":"Shyam","family":"Kamal","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/2032461"],"URL":"https:\/\/doi.org\/10.1155\/2018\/2032461","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-03-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2032461"}}