期刊文献+

模糊c-harmonic均值算法在不平衡数据上改进 被引量:3

Improvement of fuzzy c-harmonic mean algorithm on unbalanced data
原文传递
导出
摘要 针对模糊c-harmonic均值算法(FCHM)在不平衡数据集上的聚类效果不理想的问题,提出了一种基于聚类体量约束的模糊c-harmonic均值算法。首先,利用隶属度矩阵定义各个类的体量,用于约束FCHM算法的代价函数,从而构建一个新的代价函数;然后,将该代价函数最小化,得到新的隶属度矩阵和聚类中心的计算公式;最后,在UCI数据集、模拟不平衡数据集及真实机床振动检测不平衡数据集上分别进行实验。实验结果表明,与同类算法相比,本文算法在保持传统算法全局最优性能的同时,在不平衡数据集上也能得到理想的聚类效果。 A new fuzzy c-harmonic means clustering algorithm,which is based on cluster volumes constraint,is proposed in this paper to solve the problem of imperfect clustering performance of traditional algorithm for imbalanced data set.Firstly,a quantity is defined by the membership matrix to measure the volume of each cluster,which is then used to construct a new objective function by combining with that of traditional algorithm.Secondly,new membership matrix and cluster center formulas are obtained by minimizing this new objective function.The proposed algorithm was tested on the UCI data sets,simulated imbalanced data sets and actual machine vibration detection imbalanced data sets.Experimental results show that,compared with several peer algorithms,the proposed algorithm achieved good clustering performance for imbalanced data sets while maintaining the global optimal performance of the traditional one.
作者 刘富 梁艺馨 侯涛 宋阳 康冰 刘云 LIU Fu;LIANG Yi-xin;HOU Tao;SONG Yang;KANG Bing;LIU Yun(State Key Laboratory of Automotive Simulation and Control,Jilin University,Changchun 130022,China;College of Communication Engineering,Jilin University,Changchun 130022,China)
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2021年第4期1447-1453,共7页 Journal of Jilin University:Engineering and Technology Edition
基金 国家自然科学基金项目(51835006,61503151) 吉林省青年科学基金项目(20160520100JH) 中国博士后科学基金项目(2019M651204).
关键词 人工智能 聚类 模糊c-harmonic均值算法 全局最优 不平衡数据 artificial intelligence clustering fuzzy c-harmonic mean algorithm global optimality unbalanced data
  • 相关文献

参考文献3

二级参考文献25

  • 1赵恒,杨万海,张高煜.模糊K-Harmonic Means聚类算法[J].西安电子科技大学学报,2005,32(4):603-606. 被引量:6
  • 2叶吉祥,谭冠政,路秋静.基于核的非凸数据模糊K-均值聚类研究[J].计算机工程与设计,2005,26(7):1784-1785. 被引量:7
  • 3李晓宇,张新峰,沈兰荪.一种确定径向基核函数参数的方法[J].电子学报,2005,33(B12):2459-2463. 被引量:28
  • 4Likas A, Vlassis N, Verbeek J. The Global K-Means Clustering Algorithm[J]. Pattern Recognition, 2003, 36 (2): 451-461.
  • 5Bradley P S, Fayyad U M. Refining Initial Points for K- Means Clustering[A]. In Proc 15th Internation Conf on Machine Learning[C]. San Francisco: Morgan Kaufmann, 1998. 91-99.
  • 6Pena J, Lozano J, Larranaga P. An Empirical Comparison of Four Initialization Methods for the K-Means Algorithm[J]. Pattern Recognition Letters, 1999, 20(10): 1027-1040.
  • 7Al-Daoud M B, Roberts S A. New Methods for the Initialization of Clusters[J]. Pattern Recognition Letters, 1996, 17(5): 451-455.
  • 8Bezdek J C. Pattern Recognition with Fuzzy Objective Function Algorithms[M]. New York: Plenum Press, 1981.
  • 9Zhang B, Hsu M, Dayal U. K-Harmonic Means-a Data Clustering Algorithm[EB/OL]. Http://www. Hpl. Hp. Com/techreports/1999/HPL-1999-124. Pdf, 2004-12-10.
  • 10Hamerly G, Elkan C. Alternatives to the K-Means Algorithm that Find Better Clusterings [A]. In Eleventh International Conference on Information and Knowledge Management(CIKM 2002) [C]. New York:ACM Press, 2002. 600-607.

共引文献25

同被引文献21

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部