Augmentation of Soft Partition with a Granular Prototype Based Fuzzy C-Means

被引:0
作者
Wang, Ruixin [1 ]
Xu, Kaijie [2 ]
Wang, Yixi [2 ]
机构
[1] Shandong Univ, SDU ANU Joint Sci Coll, Weihai 264209, Peoples R China
[2] Xidian Univ, Sch Elect Engn, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
soft partition; granular prototypes; granular computing; membership function; Fuzzy C-Means (FCM); information granules; RECONSTRUCTION PERFORMANCE; ALGORITHM; CLASSIFICATION;
D O I
10.3390/math12111639
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Clustering is a fundamental cornerstone in unsupervised learning, playing a pivotal role in various data mining techniques. The precise and efficient classification of data stands as a central focus for numerous researchers and practitioners alike. In this study, we design an effective soft partition classification method which refines and extends the prototype of the well-known Fuzzy C-Means clustering algorithm. Specifically, the developed scheme employs membership function to extend the prototypes into a series of granular prototypes, thus achieving a deeper revelation of the structure of the data. This process softly divides the data into core and extended parts. The core part can be succinctly encapsulated through several information granules, whereas the extended part lacks discernible geometry and requires formal descriptors (such as membership formulas). Our objective is to develop information granules that shape the core structure within the dataset, delineate their characteristics, and explore the interaction among these granules that result in their deformation. The granular prototypes become the main component of the information granules and provide an optimization space for traditional prototypes. Subsequently, we apply quantum-behaved particle swarm optimization to identify the optimal partition matrix for the data. This optimized matrix significantly enhances the partition performance of the data. Experimental results provide substantial evidence of the effectiveness of the proposed approach.
引用
收藏
页数:14
相关论文
共 50 条
[1]   Augmentation of the reconstruction performance of Fuzzy C-Means with an optimized fuzzification factor vector [J].
Xu, Kaijie ;
Pedrycz, Witold ;
Li, Zhiwu .
KNOWLEDGE-BASED SYSTEMS, 2021, 222 (222)
[2]   Advanced Fuzzy Possibilistic C-means Clustering Based on Granular Computing [J].
Truong, Hung Quoc ;
Ngo, Long Thanh ;
Pedrycz, Witold .
2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, :2576-2581
[3]   Fuzzy C-Means on Metric Lattice [J].
Meng, X. ;
Liu, M. ;
Zhou, H. ;
Wu, J. ;
Xu, F. ;
Wu, Q. .
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2020, 54 (01) :30-38
[4]   Vector fuzzy C-means [J].
Hadi, Mahdipour ;
Morteza, Khademi ;
Hadi, Sadoghi Yazdi .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2013, 24 (02) :363-381
[5]   Granular Fuzzy Possibilistic C-Means Clustering approach to DNA microarray problem [J].
Hung Quoc Truong ;
Long Thanh Ngo ;
Pedrycz, Witold .
KNOWLEDGE-BASED SYSTEMS, 2017, 133 :53-65
[6]   A Soft Discretization Method of Celestial Spectrum Characteristic Line Based on Fuzzy C-Means Clustering [J].
Zhang Ji-fu ;
Li Xin ;
Yang Hai-feng .
SPECTROSCOPY AND SPECTRAL ANALYSIS, 2012, 32 (05) :1435-1438
[7]   Robust Fuzzy C-Means Based on Adaptive Relaxation [J].
Gao Yunlong ;
Wang Zhihao ;
Pan Jinyan ;
Luo Sizhe ;
Wang Dexin .
JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2020, 42 (07) :1774-1781
[8]   Grouping fuzzy granular structures based on k-means and fuzzy c-means clustering algorithms in information granulation [J].
Ren, J. ;
Zhu, P. .
IRANIAN JOURNAL OF FUZZY SYSTEMS, 2023, 20 (05) :9-31
[9]   A Novel Fuzzy SVM Based on Fuzzy C-Means for Credit Scoring [J].
Yang, Shan ;
Zhang, Zhi .
2016 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC), 2016, :1349-1353
[10]   Weighted Fuzzy C-Means: Unsupervised Feature Selection to Realize a Target Partition [J].
Sarkar, Kaushik ;
Mudi, Rajani K. ;
Pal, Nikhil R. .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2024, 32 (08) :1111-1134