Advertisement

An Integrated Clustering Framework Using Optimized K-means with Firefly and Canopies

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 32)

Abstract

Data Clustering platform is used to identify hidden homogeneous clusters of objects to analyze heterogeneous data sets based upon the attribute values in the domain of Information Retrieval, Text Mining, Web Analysis, Computational Biology and Others. In this work, a hybrid clustering algorithm for K-Means called Optimized K-Means with firefly and canopies, has been proposed by integration of two meta-heuristic algorithms: Firefly algorithm and Canopy pre-clustering algorithm. The result model has been applied for classification of breast cancer data. Haberman’s survival dataset from UCI machine learning repository is used as the benchmark dataset for evaluating the performance of the proposed integrated clustering framework. The experimental result shows that the proposed optimized K-Means with firefly and canopies model outperforms traditional K-Means algorithm in terms of classification accuracy and therefore can be used for better breast cancer diagnosis.

Keywords

K-means Firefly algorithm Canopy pre-clustering algorithm Breast cancer Classification Medical data 

References

  1. 1.
    McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of ‘high-dimensional data sets with application to reference matching. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 169–178 (2000). doi: 10.1145/347090.347123
  2. 2.
    Moore, A.W.: Very fast EM-based mixture model clustering using multi resolution kd-trees. Adv. Neural Inf. Process. Syst. 543–549 (1999)Google Scholar
  3. 3.
    Bradley, P.S., Fayyad, U., Reina, C.: Scaling clustering algorithms to large databases. In: Proceedings of 4th International Conference on Knowledge Discovery and Data Mining (KDD-98). AAAI Press, Menlo Park, Aug 1998Google Scholar
  4. 4.
    Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645–678 (2005)CrossRefGoogle Scholar
  5. 5.
    Anderberg, M.R.: Cluster Analysis for Application. Academic Press, Waltham (1973)Google Scholar
  6. 6.
    Kanungo, T., Mount, D.M.: An efficient K-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881–892 (2002)CrossRefGoogle Scholar
  7. 7.
    Garcia, J., Fdez-Valdivia, J., Cortijo, F., Molina, R.: Dynamic approach for clustering data. Signal Process. 44(2), 181–196 (1994)CrossRefGoogle Scholar
  8. 8.
    Judd, D., McKinley, P., Jain, A.: Large-scale parallel data clustering. In: Proceedings of International Conference on Pattern Recognition, Aug 1996Google Scholar
  9. 9.
    Hassanzadeh, T., Meybodi, M.R.: A new hybrid approach for data clustering using firefly algorithm and K-means, May 2012Google Scholar
  10. 10.
    Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, vol. 96, pp. 226–231, Aug 1996Google Scholar
  11. 11.
    Ester, M., Kriegel, H., Xu, X.: Knowledge discovery in large spatial databases: focusing techniques for efficient class identification. In: Advances in Spatial Databases. Springer, Berlin, pp. 67–82 (1995)Google Scholar
  12. 12.
    Dubes, R.C., Jain, A.K.: Algorithms for Clustering Data. Prentice Hall, Upper Saddle River (1988)MATHGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Computer ApplicationVeer Surendra Sai University of TechnologyBurlaIndia
  2. 2.Department of Computer Science Engineering and Information TechnologyVeer Surendra Sai University of TechnologyBurlaIndia

Personalised recommendations