New Incremental Fuzzy C Medoids Clustering Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year :

New Incremental Fuzzy C Medoids Clustering Algorithms


This paper proposes two new incremental fuzzy c medoids clustering algorithms for very large datasets. These algorithms are tailored to work with continuous data streams, where all the data is not necessarily available at once or can not fit in main memory. Some fuzzy algorithms already propose solutions to manage large datasets in a similar way but are generally limited to spatial datasets to avoid the complexity of medoids computation. Our methods keep the advantages of the fuzzy approaches and add the capability to handle large relational datasets by considering the continuous input stream of data as a set of data chunks that are processed sequentially. Two distinct models are proposed to aggregate the information discovered from each data chunk and produce the final partition of the dataset. Our new algorithms are compared to state-of-the-art fuzzy clustering algorithms on artificial and real datasets. Experiments show that our new approaches perform closely if not better than existing algorithms while adding the capability to handle relational data to better match the needs of real world applications.
No file

Dates and versions

hal-01292098 , version 1 (22-03-2016)



Nicolas Labroche. New Incremental Fuzzy C Medoids Clustering Algorithms. The North American Fuzzy Information Processing Society 2010, Jul 2010, Toronto, Canada. pp.145-150, ⟨10.1109/NAFIPS.2010.5548263⟩. ⟨hal-01292098⟩
111 View
0 Download



Gmail Facebook Twitter LinkedIn More