z-logo
open-access-imgOpen Access
FICA: Fast Incremental Clustering Algorithm
Author(s) -
Omar Kettani,
Faiçal Ramdani
Publication year - 2018
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2018916747
Subject(s) - computer science , cluster analysis , algorithm , data mining , artificial intelligence
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom