Abstract-There are an increasing number of large labeled and unlabeled data sets available. Clustering algorithms are the best suited for helping one make sense out of unlabeled data. However, scaling iterative clustering algorithms to large amounts of data has been a challenge. The computation time can be very great and for data sets that will not fit in even the largest memory, only carefully chosen subsets of data can be practically clustered. We present a general approach which enables iterative fuzzy/possibilistic clustering algorithms to be turned into algorithms that can handle arbitrary amounts of streaming data. The computation time is also reduced for very large data sets while the results of clustering will be very similar to clustering with all the data, if that was possible. We introduce transformed equations for fuzzy-c-means, possibilistic c-means, the Gustafson-Kessel algorithm and show the excellent performance with a streaming fuzzy c-means implementation. The resulting clusters are both sensible and for comparable data sets (those that fit in memory) almost identical to those obtained with the original clustering algorithm.
In REF , a general approach is proposed to enable traditional soft partitional clustering algorithms to deal with streaming data.
Creating Streaming Iterative Soft Clustering Algorithms
NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society
NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society
Computer Science