We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

FICA: Fast Incremental Clustering Algorithm

by Omar Kettani, Faical Ramdani
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

@article{ 10.5120/ijca2018916747,
author = { Omar Kettani, Faical Ramdani },
title = { FICA: Fast Incremental Clustering Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2018 },
volume = { 179 },
number = { 33 },
month = { Apr },
year = { 2018 },
issn = { 0975-8887 },
pages = { 35-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number33/29213-2018916747/ },
doi = { 10.5120/ijca2018916747 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:57:20.927172+05:30
%A Omar Kettani
%A Faical Ramdani
%T FICA: Fast Incremental Clustering Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 33
%P 35-38
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Ankerst, M., M. Breunig, H.P. Kriegel and J. Sander, 1999.OPTICS: Ordering points to identify the clustering structure. Proceeding of ACM SIGMOD International Conference Management of Data Mining, May 31-June 3, ACM Press, Philadelphia, United States, pp: 49-60.
  2. Aloise, D.; Deshpande, A.; Hansen, P.; Popat, P. (2009). "NP-hardness of Euclidean sum-of-squares clustering". Machine Learning 75: 245–249. doi:10.1007/s10994-009-5103-0.
  3. Lloyd, S.P., 1982. Least square quantization in PCM. IEEE Trans. Inform. Theor., 28: 129-136.
  4. MacQueen, J.B., 1967. Some Method for Classification and Analysis of Multivariate Observations, Proceeding of the Berkeley Symposium on Mathematical Statistics and Probability, (MSP’67), Berkeley, University of California Press, pp: 281-297.
  5. Katsavounidis, I., C.C.J. Kuo and Z. Zhen, 1994. A new initialization technique for generalized Lloyd iteration. IEEE. Sig. Process. Lett., 1: 144-146.
  6. [Asuncion, A. and Newman, D.J. (2007). UCI Machine Learning Repository [http://www.ics.uci.edu/~mlearn/MLRepository.html] Irvine, CA: University of California, School of Information and Computer Science.
  7. L. Kaufman and P. J. Rousseeuw. Finding groups in Data: “an Introduction to Cluster Analysis”. Wiley, 1990.
Index Terms

Computer Science
Information Sciences

Keywords

Clustering k-means KKZ Silhouette.