{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:14:40Z","timestamp":1769523280299,"version":"3.49.0"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:00:00Z","timestamp":1636502400000},"content-version":"vor","delay-in-days":313,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["20YJAZH084"],"award-info":[{"award-number":["20YJAZH084"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["18XJC880002"],"award-info":[{"award-number":["18XJC880002"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJQN201800539"],"award-info":[{"award-number":["KJQN201800539"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJZD-K202100505"],"award-info":[{"award-number":["KJZD-K202100505"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Traditional clustering methods often cannot avoid the problem of selecting neighborhood parameters and the number of clusters, and the optimal selection of these parameters varies among different shapes of data, which requires prior knowledge. To address the above parameter selection problem, we propose an effective clustering algorithm based on adaptive neighborhood, which can obtain satisfactory clustering results without setting the neighborhood parameters and the number of clusters. The core idea of the algorithm is to first iterate adaptively to a logarithmic stable state and obtain neighborhood information according to the distribution characteristics of the dataset, and then mark and peel the boundary points according to this neighborhood information, and finally cluster the data clusters with the core points as the centers. We have conducted extensive comparative experiments on datasets of different sizes and different distributions and achieved satisfactory experimental results.<\/jats:p>","DOI":"10.1155\/2021\/6785580","type":"journal-article","created":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T06:05:30Z","timestamp":1636610730000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Clustering Algorithm Using Adaptive Neighborhood and Border Peeling Method"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9587-555X","authenticated-orcid":false,"given":"Ji","family":"Feng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9978-4698","authenticated-orcid":false,"given":"Bokai","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-2703","authenticated-orcid":false,"given":"Ruisheng","family":"Ran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5114-1212","authenticated-orcid":false,"given":"Wanli","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8582-4302","authenticated-orcid":false,"given":"Degang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.05.007"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2018.9020017"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-016-0598-1"},{"key":"e_1_2_9_5_2","first-page":"19","article-title":"Adaptive spectral clustering algorithm based on natural neighbors","volume":"27","author":"Zhu Q.","year":"2017","journal-title":"Computer Technology and Development"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2985425"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.10.014"},{"key":"e_1_2_9_8_2","first-page":"998","article-title":"Parameter-free outlier detection algorithm based on natural neighbor neighborhood graph","volume":"14","author":"Feng J.","year":"2019","journal-title":"CAAI Transactions on Intelligent System"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/11881070_7"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2007.47"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2017.2787640"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2733381"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107295"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2903410"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2013.57"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2016.2553459"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.308853"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"e_1_2_9_20_2","unstructured":"EsterM. KriegelH.-P. SanderJ. andXuX. A density-based algorithm for discovering clusters in large spatial databases with noise Proceedings of the Second International Conference on Knowledge Discovery and Data Mining August 1996 Portland OR USA 226\u2013231."},{"key":"e_1_2_9_21_2","doi-asserted-by":"crossref","unstructured":"DingC. HeX. andSimonH. D. On the equivalence of nonnegative matrix factorization and spectral clustering Proceedings of the 2005 SIAM International Conference on Data Mining April 2005 Newport Beach CA USA 606\u2013610 https:\/\/doi.org\/10.1137\/1.9781611972757.70.","DOI":"10.1137\/1.9781611972757.70"},{"key":"e_1_2_9_22_2","doi-asserted-by":"crossref","unstructured":"QiuB.-Z. ZhangX. andShenJ. Grid-based clustering algorithm for multi-density 3 Proceedings of the 2005 International Conference on Machine Learning and Cybernetics August 2005 Guangzhou China 1509\u20131512.","DOI":"10.1109\/ICMLC.2005.1527183"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5608-2"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.400568"},{"key":"e_1_2_9_26_2","doi-asserted-by":"crossref","unstructured":"GeorgescuS.andMeer Mean shift based clustering in high dimensions: a texture classification example 1 Proceedings of the Ninth IEEE International Conference on Computer Vision April 2003 Nice France 456\u2013463 https:\/\/doi.org\/10.1109\/iccv.2003.1238382.","DOI":"10.1109\/ICCV.2003.1238382"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2019.2924953"},{"key":"e_1_2_9_28_2","unstructured":"LeCunY.andCortesC. MNIST handwritten digit database 2010 http:\/\/yann.lecun.com\/exdb\/mnist\/."}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6785580.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6785580.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6785580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T22:44:12Z","timestamp":1726094652000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6785580"}},"subtitle":[],"editor":[{"given":"Xing","family":"He","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6785580"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6785580","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-05-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6785580"}}