{"title":"(2004-5811) Improved fuzzy clustering algorithm using adaptive particle swarm optimization for nonlinear system modeling and identification","authors":"L. Houcine, Mohamed Bouzbida, A. Chaari","doi":"10.22111/IJFS.2021.5987","DOIUrl":null,"url":null,"abstract":"In this paper, an improved Type2-PCM clustering algorithm based on improved adaptive particle swarm optimization called Type2-PCM-IAPSO is proposed. Firstly, a new clustering algorithm called Type2-PCM is proposed. The Type2-PCM algorithm can solve the problems encountered by fuzzy c-means algorithm (FCM), Gustafson-Kessel algorithm (G-K), possibilistic c-means algorithm (PCM) and NPCM (sensitivity to noise or aberrant points and local minimal sensitivity). . . etc. Secondly, we combined our Type2-PCM algorithm with the improved adaptive particle swarm optimization algorithm (IAPSO) to ensure proper convergence to a local minimum of the objective function. The effectiveness of the two proposed algorithms Type2-PCM and Type2-PCM-IAPSO was tested on a system described by a different equation, Box-Jenkins gas furnace, dryer system and the convection system. The validation tests used showed good performance of these algorithms. However, their average square error test (MSE) shows a better behaviour of the Type2-PCM-IAPSO algorithm compared to the FCM, G-K, PCM, FCM-PSO, Type2-PCM-PSO, RKPFCM and RKPFCM-PSO algorithms.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.22111/IJFS.2021.5987","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, an improved Type2-PCM clustering algorithm based on improved adaptive particle swarm optimization called Type2-PCM-IAPSO is proposed. Firstly, a new clustering algorithm called Type2-PCM is proposed. The Type2-PCM algorithm can solve the problems encountered by fuzzy c-means algorithm (FCM), Gustafson-Kessel algorithm (G-K), possibilistic c-means algorithm (PCM) and NPCM (sensitivity to noise or aberrant points and local minimal sensitivity). . . etc. Secondly, we combined our Type2-PCM algorithm with the improved adaptive particle swarm optimization algorithm (IAPSO) to ensure proper convergence to a local minimum of the objective function. The effectiveness of the two proposed algorithms Type2-PCM and Type2-PCM-IAPSO was tested on a system described by a different equation, Box-Jenkins gas furnace, dryer system and the convection system. The validation tests used showed good performance of these algorithms. However, their average square error test (MSE) shows a better behaviour of the Type2-PCM-IAPSO algorithm compared to the FCM, G-K, PCM, FCM-PSO, Type2-PCM-PSO, RKPFCM and RKPFCM-PSO algorithms.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.