{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:21:11Z","timestamp":1756682471571,"version":"3.37.3"},"reference-count":27,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003488","name":"Henan Polytechnic University","doi-asserted-by":"publisher","award":["61872126"],"award-info":[{"award-number":["61872126"]}],"id":[{"id":"10.13039\/501100003488","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Fund subsidized project","award":["61872126"],"award-info":[{"award-number":["61872126"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2022,3,28]]},"abstract":"<jats:p>In the era of big data, more and more datasets are gradually beyond the application scope of traditional clustering algorithms because of their large scale and high dimensions. In order to break through the limitations, incremental mechanism and feature reduction have become two indispensable parts of current clustering algorithms. Combined with single-pass and online incremental strategies, respectively, we propose two incremental fuzzy clustering algorithms based on feature reduction. The first uses the Weighted Feature Reduction Fuzzy C-Means (WFRFCM) clustering algorithm to process each chunk in turn and combines the clustering results of the previous chunk into the latter chunk for common calculation. The second uses the WFRFCM algorithm for each chunk to cluster at the same time, and the clustering results of each chunk are combined and calculated again. In order to investigate the clustering performance of these two algorithms, six datasets were selected for comparative experiments. Experimental results showed that these two algorithms could select high-quality features based on feature reduction and process large-scale data by introducing the incremental strategy. The combination of the two phases can not only ensure the clustering efficiency but also keep higher clustering accuracy.<\/jats:p>","DOI":"10.1155\/2022\/8566253","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:35:12Z","timestamp":1648510512000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Fuzzy Clustering Based on Feature Reduction"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-865X","authenticated-orcid":true,"given":"Yongli","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, Henan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0693-2699","authenticated-orcid":true,"given":"Yajun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, Henan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6700-9446","authenticated-orcid":true,"given":"Hao","family":"Chao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, Henan, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/s0019-9958(65)90241-x"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/s0019-9958(69)90591-9"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0450-1_3"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(84)90020-7"},{"issue":"2","key":"6","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/TFUZZ.2017.2692203","article-title":"A feature-reduction fuzzy clustering algorithm based on feature-weighted entropy[J]","volume":"26","author":"M. S. Yang","year":"2017","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106549"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.icte.2020.12.006"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.02.047"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.06.096"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-201395"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2021.166566"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2020.1740615"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.08.121"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.07.018"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.11.025"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113840"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107624"},{"first-page":"1","article-title":"Single pass fuzzy c means","author":"P. Hore","key":"19"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-008-0243-1"},{"first-page":"614","article-title":"Incremental hyperplane-based fuzzy clustering for system modeling","author":"C. H. Kim","key":"21"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.033"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2013.12.004"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2011.581395"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108064"},{"issue":"4","key":"26","first-page":"29","article-title":"Incremental fuzzy C-ordered means clustering[J]","volume":"41","author":"Y. Liu","year":"2018","journal-title":"Journal of Beijing University of Posts and Telecommunications"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.016"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/8566253.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/8566253.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2022\/8566253.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:35:20Z","timestamp":1648510520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jece\/2022\/8566253\/"}},"subtitle":[],"editor":[{"given":"Vinod","family":"Sharma","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":27,"alternative-id":["8566253","8566253"],"URL":"https:\/\/doi.org\/10.1155\/2022\/8566253","relation":{},"ISSN":["2090-0155","2090-0147"],"issn-type":[{"type":"electronic","value":"2090-0155"},{"type":"print","value":"2090-0147"}],"subject":[],"published":{"date-parts":[[2022,3,28]]}}}