Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2018, Vol. 41 ›› Issue (4): 29-36.doi: 10.13190/j.jbupt.2018-026

• Papers • Previous Articles     Next Articles

Incremental Fuzzy C-Ordered Means Clustering

LIU Yong-li, GUO Cheng-yi, WANG Heng-da, CHAO Hao   

  1. School of Computer Science and Technology, Henan Polytechnic University, Henan Jiaozuo 454000, China
  • Received:2018-01-26 Online:2018-08-28 Published:2018-10-09

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.

Key words: fuzzy clustering, incremental clustering, robustness

CLC Number: