[1]郭 静,蔡超越,陆 杨,等.基于证据信息粒化的深度三支FCM聚类方法[J].南京师大学报(自然科学版),2025,48(04):106-117.[doi:10.3969/j.issn.1001-4616.2025.04.011]
　Guo Jing,Cai Chaoyue,Lu Yang,et al.Deep Three-Way FCM Clustering Method Based on Evidential Information Granulation[J].Journal of Nanjing Normal University(Natural Science Edition),2025,48(04):106-117.[doi:10.3969/j.issn.1001-4616.2025.04.011]
点击复制

基于证据信息粒化的深度三支FCM聚类方法()

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

卷:
48
期数:
2025年04期
页码:
106-117
栏目:
计算机科学与技术
出版日期:
2025-08-20

文章信息/Info

Title:
Deep Three-Way FCM Clustering Method Based on Evidential Information Granulation
文章编号:
1001-4616(2025)04-0106-12
作者:
郭 静1; 蔡超越1; 陆 杨1; 成晓天1; 樊晓雪1; 鞠恒荣1; 2; 丁卫平1
(1.南通大学人工智能与计算机学院,江苏 南通 226019)
(2.南京大学计算机软件新技术国家重点实验室,江苏 南京 210000)
Author(s):
Guo Jing1; Cai Chaoyue1; Lu Yang1; Cheng Xiaotian1; Fan Xiaoxue1; Ju Hengrong1; 2; Ding Weiping1
(1.School of Artificial Intelligence and Computer Science,Nantong University,Nantong 226019,China)
(2.State Key Lab. for Novel Software Technology,Nanjing University,Nanjing 210000,China)
关键词:
证据理论; 三支决策; 信息粒化; FCM聚类; 深度聚类; 对比学习
Keywords:
evidential theory; three-way decision; information granulation; FCM clustering; deep clustering; contrastive learning
分类号:
TH212
DOI:
10.3969/j.issn.1001-4616.2025.04.011
文献标志码:
A
摘要:
深度聚类由于其在数据挖掘和计算机视觉领域中处理高维数据的显著效果,已经成为一种流行的无监督学习方法. 高维空间中的数据更容易存在模糊性,然而深度聚类无法直接处理数据中的模糊性. 在许多实际问题中,数据之间相似性和关联性通常更集中的表现在局部邻域内,但是传统的深度聚类方法忽略了数据之间的局部关系. 为了解决上述问题,本文提出了一种基于证据信息粒化的深度三支FCM聚类方法. 首先,本文提出一种新的对比深度FCM聚类网络框架,将数据从复杂的原始数据空间映射到合适的深度特征空间中. 其次,基于三支决策的思想,将第一阶段的聚类结果划分为正域和边界域,以便处理数据中的不确定性. 最后,引入半球邻域粒化方法,为不确定样本构造信息粒. 基于此,本文利用证据理论对信息粒中的信任度进行融合,从而实现对不确定数据的再分配. 本文所提方法更多地关注数据的局部结构,以准确地捕捉数据的内在特征. 实验结果表明,本文所提出的方法有效地提升了聚类效果.
Abstract:
Deep clustering has become a popular unsupervised learning method due to its remarkable effect in processing high-dimensional data in the field of data mining and computer vision. Data in high-dimensional space are more likely to have ambiguity,but deep clustering cannot directly handle the ambiguity in data. In many practical problems,the similarities and correlations between data are usually more concentrated in local neighborhoods,but traditional deep clustering methods ignore the local relationships between data. In order to solve the above problems,this paper proposes a deep three-way FCM clustering method based on evidential information granulation. First,this paper proposes a contrastive deep FCM clustering network framework to map data from complex original data space to a suitable deep feature space. Secondly,based on the idea of three-way decision,the clustering results of the first stage are divided into the positive regions and boundary regions in order to deal with the uncertainty in the data. Finally,the semiball neighborhood granulation method is introduced to construct information granules for uncertain samples. Based on this,this paper uses evidential theory to integrate trust in information particles to achieve the redistribution of uncertain data. The method proposed in this paper pays more attention to the local structure of the data to accurately capture the intrinsic characteristics of the data. Experimental results show that the method proposed in this paper effectively improves the clustering effect.

参考文献/References:

[1]TORTORA C,PALUMBO F. Clustering mixed-type data using a probabilistic distance algorithm[J]. Applied soft computing,2022,130:109704.
[2]JU H,LU Y,DING W,et al. Three-way evidence theory-based density peak clustering with the principle of justifiable granularity[J]. Applied soft computing,2024,152:111217.
[3]CHOUDHARY A,BADHOLIA A,SHARMA A,et al. A dynamic K-means-based clustering algorithm using fuzzy logic for CH selection and data transmission based on machine learning[J]. Soft computing,2023,27(10):6135-6149.
[4]RAJPATHAK D G,SINGH S. An ontology-based text mining method to develop D-matrix from unstructured text[J]. IEEE transactions on systems,man,and cybernetics:systems,2013,44(7):966-977.
[5]ZHANG Q,YANG L T,CHEN Z,et al. PPHOPCM:Privacy-preserving high-order possibilistic c-means algorithm for big data clustering with cloud computing[J]. IEEE transactions on big data,2017,8(1):25-34.
[6]KUMAR P,AGRAWAL R K,KUMAR D. Fast and robust spatial fuzzy bounded k-plane clustering method for human brain MRI image segmentation[J]. Applied soft computing,2023,133:109939.
[7]ZHAO Q,WANG C,WANG P,et al. A novel method on information recommendation via hybrid similarity[J]. IEEE transactions on systems,man,and cybernetics:systems,2016,48(3):448-459.
[8]CELEBI M E. Partitional clustering algorithms[M]. Berlin:Springer,2014.
[9]LLOYD S. Least squares quantization in PCM[J]. IEEE transactions on information theory,1982,28(2):129-137.
[10]VERMA H,VERMA D,TIWARI P K. A population based hybrid FCM-PSO algorithm for clustering analysis and segmentation of brain image[J]. Expert systems with applications,2021,167:114121.
[11]LESKI J M. Fuzzy c-ordered-means clustering[J]. Fuzzy sets and systems,2016,286:114-133.
[12]WANG Z,SONG Q,SOH Y C,et al. An adaptive spatial information-theoretic fuzzy clustering algorithm for image segmentation[J]. Computer vision and image understanding,2013,117(10):1412-1420.
[13]ZHANG D Q,CHEN S C,PAN Z S,et al. Kernel-based fuzzy clustering incorporating spatial constraints for image segmentation[C]//Proceedings of the 2003 International Conference on Machine Learning and Cybernetics(IEEE Cat. No. 03EX693). Piscataway:IEEE,2003,4:2189-2192.
[14]YAO Y. Three-way decisions with probabilistic rough sets[J]. Information sciences,2010,180(3):341-353.
[15]YAO Y. The superiority of three-way decisions in probabilistic rough set models[J]. Information sciences,2011,181(6):1080-1096.
[16]YAO Y. Three-way decisions and cognitive computing[J]. Cognitive computation,2016,8(4):543-554.
[17]徐天杰,王平心,杨习贝. 基于人工蜂群的三支k-means聚类算法[J]. 计算机科学,2023,50(06):116-121.
[18]WANG P,SHI H,YANG X,et al. Three-way k-means:Integrating k-means and three-way decision[J]. International journal of machine learning and cybernetics,2019,10:2767-2777.
[19]DUNDAR A,JIN J,CULURCIELLO E. Convolutional clustering for unsupervised learning[J/OL]. arXiv Preprint arXiv:1511.06241,2015.
[20]BENGIO Y,COURVILLE A,VINCENT P. Representation learning:A review and new perspectives[J]. IEEE transactions on pattern analysis and machine intelligence,2013,35(8):1798-1828.
[21]HINTON G E,SALAKHUTDINOV R R. Reducing the dimensionality of data with neural networks[J]. Science,2006,313(5786):504-507.
[22]PENG X,XIAO S,FENG J,et al. Deep subspace clustering with sparsity prior[C]//International Joint Conference on Artifical Intelligen. San Francisco,2016:1925-1931.
[23]JI P,ZHANG T,LI H,et al. Deep subspace clustering networks[J]. Advances in neural information processing systems,2017,30:1-10.
[24]LI F,QIAO H,ZHANG B. Discriminatively boosted image clustering with fully convolutional auto-encoders[J]. Pattern recognition,2018,83:161-173.
[25]AFFELDT S,LABIOD L,NADIF M. Spectral clustering via ensemble deep autoencoder learning(SC-EDAE)[J]. Pattern recognition,2020,108:107522.
[26]XIE J,GIRSHICK R,FARHADI A. Unsupervised deep embedding for clustering analysis[C]//International Conference on Machine Learning. New York,2016:478-487.
[27]ZHANG R,LI X,ZHANG H,et al. Deep fuzzy k-means with adaptive loss and entropy regularization[J]. IEEE transactions on fuzzy systems,2019,28(11):2814-2824.
[28]CHEN T,KORNBLITH S,NOROUZI M,et al. A simple framework for contrastive learning of visual representations[C]//International Conference on Machine Learning. PMLR,2020:1597-1607.
[29]LI Y,HU P,LIU Z,et al. Contrastive clustering[C]//Proceedings of the AAAI Conference on Artificial Intelligence. Polo Alto,2021,35(10):8547-8555.
[30]许洁,王立松. 一种结构关系一致的对比聚类方法[J]. 计算机科学,2023,50(09):123-129.
[31]NIE F,WANG H,HUANG H,et al. Adaptive loss minimization for semi-supervised elastic embedding[C]//Twenty-Third International Joint Conference on Artificial Intelligence. San Francisco,2013.
[32]DING C. A new robust function that smoothly interpolates between l1 and l2 error functions[J]. Univerisity of Texas at Arlington technical report,2013.
[33]HULL J J. A database for handwritten text recognition research[J]. IEEE transactions on pattern analysis and machine intelligence,1994,16(5):550-554.
[34]CAI D,ZHANG C,HE X. Unsupervised feature selection for multi-cluster data[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York,2010:333-342.
[35]LYONS M J,BUDYNEK J,AKAMATSU S. Automatic classification of single facial images[J]. IEEE transactions on pattern analysis and machine intelligence,1999,21(12):1357-1362.
[36]NENE S A,NAYAR S K,MURASE H. Columbia object image library(coil-20)[R]. Technical Report CUCS-006-93.1996:1-4.
[37]RUSPINI E H. A new approach to clustering[J]. Information and control,1969,15(1):22-32.
[38]GUO W,LIN K,YE W. Deep embedded k-means clustering[C]//2021 International Conference on Data Mining Workshops(ICDMW). Piscataway:IEEE,2021:686-694.
[39]KINGMA D P,BA J. Adam:A method for stochastic optimization[J/OL]. arXiv Preprint arXiv:1412.6980,2014.

相似文献/References:

[1]施 虹,刘 强,王平心,等.基于三支决策的谱聚类算法研究[J].南京师大学报(自然科学版),2018,41(03):6.[doi:10.3969/j.issn.1001-4616.2018.03.002]
　Shi Hong,Liu Qiang,Wang Pingxin,et al.Research on Spectral Clustering Algorithm Based on Three-way Decision[J].Journal of Nanjing Normal University(Natural Science Edition),2018,41(04):6.[doi:10.3969/j.issn.1001-4616.2018.03.002]

备注/Memo

备注/Memo:
收稿日期:2024-09-24.
基金项目:国家自然科学基金资助项目(62006128、U2433216、62066049)、国家重点研发计划资助项目(2024YFE0202700)、江苏高校‘青蓝工程'资助、南京大学计算机软件新技术国家重点实验室资助项目(KFKT2024B30)、江苏省自然科学基金资助项目(BK20231337)、江苏省高等学校自然科学研究重大资助项目(21KJA510004)、江苏省研究生科研与实践创新计划资助项目(SJCX24_2016、SJCX25_2001)、南通市自然
更新日期/Last Update: 2025-08-20