首页 | 本学科首页   官方微博 | 高级检索  
     

增量式模糊C有序均值聚类算法
引用本文:刘永利,郭呈怡,王恒达,晁浩.增量式模糊C有序均值聚类算法[J].北京邮电大学学报,2018,41(4):29-36.
作者姓名:刘永利  郭呈怡  王恒达  晁浩
作者单位:河南理工大学 计算机科学与技术学院, 河南 焦作 454000
基金项目:河南省高等学校青年骨干教师项目;河南省科技攻关计划项目;河南省高校基本科研业务费专项资金项目
摘    要:针对传统聚类算法难以处理大规模数据和对噪声数据敏感等问题,基于模糊C有序均值聚类算法(FCOM),结合single-pass和online增量架构,分别提出了single-pass模糊C有序均值聚类算法(SPFCOM)和online模糊C有序均值聚类算法(OFCOM).SPFCOM和OFCOM算法首先对FCOM算法加权,然后以数据块为单位对数据集合进行增量式处理.实验结果表明,相较于对比算法,SPFCOM和OFCOM算法在聚类准确率方面得到了提高,还具有更强的鲁棒性.

关 键 词:模糊聚类  增量聚类  鲁棒性  
收稿时间:2018-01-26

Incremental Fuzzy C-Ordered Means Clustering
LIU Yong-li,GUO Cheng-yi,WANG Heng-da,CHAO Hao.Incremental Fuzzy C-Ordered Means Clustering[J].Journal of Beijing University of Posts and Telecommunications,2018,41(4):29-36.
Authors:LIU Yong-li  GUO Cheng-yi  WANG Heng-da  CHAO Hao
Affiliation:School of Computer Science and Technology, Henan Polytechnic University, Henan Jiaozuo 454000, China
Abstract:Because traditional clustering algorithms are difficult to deal with large-scale data and sensitive to noise data, based on the Fuzzy C-ordered-means clustering (FCOM) algorithm, we propose a single-pass fuzzy C-ordered clustering algorithm, named SPFCOM, and an online fuzzy C-ordered clustering algorithm, named OFCOM, by combining single-pass and online incremental architectures respectively. These two algorithms weight the FCOM algorithm, and incrementally process the large-scale data chunk by chunk. Experimental results show that, compared with other similar prominent algorithms, the SPFCOM and OFCOM algorithms can achieve higher accuracy and better robustness.
Keywords:fuzzy clustering  incremental clustering  robustness  
本文献已被 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号