A Fuzzy Density-based Incremental Clustering Algorithm
Sirisup Laohakiat, Photchanan Ratanajaipan, Leenhapat Navaravong, Rachanee Ungrangsi, Krissada Maleewong
Abstract
Sirisup Laohakiat, Photchanan Ratanajaipan, Leenhapat Navaravong, Rachanee Ungrangsi, Krissada Maleewong
Abstract
This study presents a density-based incremental clustering algorithm which incorporates the concept of fuzzy set in clustering. Unlike other existing fuzzy clustering algorithms which are c-mean clustering where the number of clusters must be pre-defined, the proposed algorithm incorporates the concept of fuzzy set into density-based clustering where the number of clusters is not restricted. Moreover, the proposed algorithm uses incremental clustering usually employed in stream data clustering, leading to linear computation time, rather than quadratic computation time as in other density-based clustering. The proposed algorithm outperforms other existing density-based clustering algorithms in terms of both clustering results and computation time. As a result, the proposed algorithm can much efficiently process large data sets than other density-based clustering algorithms.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This study presents a density-based incremental clustering algorithm which incorporates the concept of fuzzy set in clustering. Unlike other existing fuzzy clustering algorithms which are c-mean clustering where the number of clusters must be pre-defined, the proposed algorithm incorporates the concept of fuzzy set into density-based clustering where the number of clusters is not restricted. Moreover, the proposed algorithm uses incremental clustering usually employed in stream data clustering, leading to linear computation time, rather than quadratic computation time as in other density-based clustering. The proposed algorithm outperforms other existing density-based clustering algorithms in terms of both clustering results and computation time. As a result, the proposed algorithm can much efficiently process large data sets than other density-based clustering algorithms.
Key concepts: Cluster analysis, CURE data clustering algorithm, Correlation clustering, Canopy clustering algorithm, Fuzzy clustering, Data stream clustering, Determining the number of clusters in a data set, Computer science