{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:13:57Z","timestamp":1753888437103,"version":"3.41.2"},"reference-count":30,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"vor","delay-in-days":207,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010726","name":"Northwest Normal University","doi-asserted-by":"publisher","award":["61962054"],"award-info":[{"award-number":["61962054"]}],"id":[{"id":"10.13039\/100010726","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The find of density peak clustering algorithm (FDP) has poor performance on high\u2010dimensional data. This problem occurs because the clustering algorithm ignores the feature selection. All features are evaluated and calculated under the same weight, without distinguishing. This will lead to the final clustering effect which cannot achieve the expected. Aiming at this problem, we propose a new method to solve it. We calculate the importance value of all features of high\u2010dimensional data and calculate the mean value by constructing random forest. The features whose importance value is less than 10% of the mean value are removed. At this time, we extract the important features to form a new dataset. At this time, improved t\u2010SNE is used for dimension reduction, and better performance will be obtained. This method uses t\u2010SNE that is improved by the idea of random forest to reduce the dimension of the original data and combines with improved FDP to compose the new clustering method. Through experiments, we find that the evaluation index NMI of the improved algorithm proposed in this paper is 23% higher than that of the original FDP algorithm, and 9.1% higher than that of other clustering algorithms (<jats:italic>K<\/jats:italic>\u2010means, DBSCAN, and spectral clustering). It has good performance in high\u2010dimensional datasets that are verified by experiments on UCI datasets and wireless sensor networks.<\/jats:p>","DOI":"10.1155\/2021\/9977884","type":"journal-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T23:05:09Z","timestamp":1627427109000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Algorithm Based on Fast Search and Find of Density Peak Clustering for High\u2010Dimensional Data"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8474-2591","authenticated-orcid":false,"given":"Hui","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5524-4809","authenticated-orcid":false,"given":"Yiyang","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0437-2453","authenticated-orcid":false,"given":"Zhihe","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,7,27]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1251329"},{"key":"e_1_2_9_3_2","unstructured":"EsterM. KriegelH.-P. SanderJ. andXuX. A density-based algorithm for discovering clusters in large spatial databases with noise 8 Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining (KDD\u203296) 1996 Miinchen German 226\u2013231."},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2009.06.012"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1214\/11-aos887"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.53"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10950-020-09928-1"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.85677"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113277"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/wics.101"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2018.2850823"},{"key":"e_1_2_9_13_2","first-page":"722","article-title":"A dynamic cluster model based on projection pursuit with its application to climate zoning","volume":"18","author":"Wang S.","year":"2007","journal-title":"Journal of Applied Meteorological Science"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2475755"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6625184"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.03.001"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5574732"},{"key":"e_1_2_9_18_2","first-page":"833","article-title":"Stochastic neighbor embedding","volume":"15","author":"Hinton G. E.","year":"2003","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_9_19_2","first-page":"2579","article-title":"Visualizing high-dimensional data using t-SNE","volume":"9","author":"van der Maaten L.","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2019.115940"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1114856"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10827-4"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.11.010"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04277-5_18"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/42.563664"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005601"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2005.04.009"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.07.021"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.1240"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/9977884.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/9977884.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/9977884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T13:39:25Z","timestamp":1723037965000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/9977884"}},"subtitle":[],"editor":[{"given":"Xingsi","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/9977884"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9977884","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9977884"}}