International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 179 - Number 33 |
Year of Publication: 2018 |
Authors: Omar Kettani, Faical Ramdani |
10.5120/ijca2018916747 |
Omar Kettani, Faical Ramdani . FICA: Fast Incremental Clustering Algorithm. International Journal of Computer Applications. 179, 33 ( Apr 2018), 35-38. DOI=10.5120/ijca2018916747
In this study a simple deterministic clustering method, called FICA (Fast Incremental Clustering Algorithm) is proposed. Its initialization phase consists to run the Katsavounidis, Kuo & Zhang (KKZ) seed procedure, and its incremental step consists simply to assign each data point to its nearest cluster, then the centroid of the last modified cluster is updated. The proposed approach has a lower computational time complexity than the famous k-means algorithm. We evaluated its performance by applying on various benchmark datasets and compare with a related deterministic clustering method: KKZ_ k-means (k-means initialized by KKZ). Experimental results have demonstrated that the proposed approach is effective in producing consistent clustering results in term of average Silhouette index.