A Weight Possibilistic Fuzzy C-Means Clustering Algorithm

Author:

Chen Jiashun1ORCID,Zhang Hao2,Pi Dechang3,Kantardzic Mehmed4,Yin Qi1,Liu Xin1

Affiliation:

1. School of Computer Engineering, Jiangsu Ocean University, Lianyungang, Jiangsu 222003, China

2. School of Mathematics and Information Engineering, Lianyungang Normal College, Lianyungang, Jiangsu 222003, China

3. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics Nanjing, Jiangsu 210016, China

4. J. B Speed School of Engineering, University of Louisville, KY 40208, USA

Abstract

Fuzzy C-means (FCM) is an important clustering algorithm with broad applications such as retail market data analysis, network monitoring, web usage mining, and stock market prediction. Especially, parameters in FCM have influence on clustering results. However, a lot of FCM algorithm did not solve the problem, that is, how to set parameters. In this study, we present a kind of method for computing parameters values according to role of parameters in the clustering process. New parameters are assigned to membership and typicality so as to modify objective function, on the basis of which Lagrange equation is constructed and iterative equation of membership is acquired, so does the typicality and center equation. At last, a new possibilistic fuzzy C-means based on the weight parameter algorithm (WPFCM) was proposed. In order to test the efficiency of the algorithm, some experiments on different datasets are conducted to compare WPFCM with FCM, possibilistic C-means (PCM), and possibilistic fuzzy C-means (PFCM). Experimental results show that iterative times of WPFCM are less than FCM about 25% and PFCM about 65% on dataset X12. Resubstitution errors of WPFCM are less than FCM about 19% and PCM about 74% and PFCM about 10% on the IRIS dataset.

Funder

Petrel Program of Lianyungang Jiangsu Province, China

Publisher

Hindawi Limited

Subject

Computer Science Applications,Software

Reference35 articles.

1. Scalable kernel k-means clustering with nystrom approximation: relative-error bounds;S. S. Wang;Journal of Machine Learning Research,2019

2. Partition level multiview subspace clustering;K. Zhao;Neural Networks,2020

3. A knowledge-based approach to hierarchical classification: a voting metaphor;D. Fogli;Expert Systems with Applications,2020

4. RECOME: A new density-based clustering algorithm using relative KNN kernel density

5. A new density-based subspace selection method using mutual information for high dimensional outlier detection

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3