Skip to main content

A New Clustering Algorithm Based on Chameleon Army Strategy

  • Conference paper
Recent Advances in Information and Communication Technology

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 265))

Abstract

In this paper we present a new clustering algorithm based on a new heuristic we call Chameleon Army. This heuristic simulates a Army stratagem and Chameleon behavior. The proposed algorithm is implemented and tested on well known dataset. The obtained results are compared to those of the algorithms K-means, PSO, and PSO-kmeans. The results show that the proposed algorithm gives better clusters.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: International Conference on Management data, pp. 94–105. ACM SIGMOD (1998)

    Google Scholar 

  2. Nagesh, H., Goil, S.: Choudhary: MAFIA. Efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010 (1999)

    Google Scholar 

  3. Sheikholeslami, G., Chatterjee, S., Zhang, A.: Wave cluster: A multi-resolution clustering approach for very large spatial databases. In: 24th International Conference on Very Large Data Bases, New York City, USA, pp. 428–439 (1998)

    Google Scholar 

  4. Kaufman, L., Rousseeuw, P.J.: Finding groups in data. An Introduction to Cluster Analysis. John Wiley & Sons (1990)

    Google Scholar 

  5. Sneath, P.H.A., Sokal, R.R.: Numerical Taxonomy: the Principles and Practice of Numerical Classification. W. H. Freeman and Company, San Francisco (1973)

    MATH  Google Scholar 

  6. Vazirani, V.V.: Algorithmes d’approximation. Collection IRIS. Springer (2006)

    Google Scholar 

  7. Colanzi, T.E., Assunção, W.K.K.G., Pozo, A.T.R., Vendramin, A.C.B.K., Pereira, D.A.B., Zorzo, C.A., de Paula Filho, P.L.: Application of Bio-inspired Metaheuristics in the Data Clustering Problem. Clei Electronic Journal 14(3) (2011)

    Google Scholar 

  8. Merz, C.J., Blake, C.L.: UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/-mlearn/MLRepository.html

  9. Jain, A.K.: Data clustering: 50 Years beyond K-means. Pattern Recognition Letters 31, 651–666 (2010)

    Article  Google Scholar 

  10. Xiaohui, C., Potok, T.E.: Document Clustering Analysis Based on Hybrid PSO+K-means Algorithm. Applied Software Engineering Research Group, Computational Sciences and Engineering Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831- 6085, USA (2005)

    Google Scholar 

  11. Likas, A., Vlassis, M., Verbeek, J.: The global k-means clustering algorithm. Pattern Recognition 36, 451–461 (2003)

    Article  Google Scholar 

  12. Milligan, G.W.: The validation of four ultrametric clustering algorithms. Pattern Recognition 12, 41–50 (1980)

    Article  Google Scholar 

  13. Bradley, P.S., Fayyad, U.M.: Refining initial points for K-Means clustering. In: 15th International Conf. on Machine Learning, pp. 91–99. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  14. Mirkin, B.: Clustering for data mining: A data recovery approach. Chapman and Hall, London (2005)

    Book  Google Scholar 

  15. Kwedlo, W., Iwanowicz, P.: Using Genetic Algorithm for Selection of Initial Cluster Centers for the K-Means Method. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part II. LNCS (LNAI), vol. 6114, pp. 165–172. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Alireza, A., Hamidreza, M.: Combining PSO and k-means to Enhance Data Clustering. In: International Symposium on Telecommunication, Tehran, vol. 1 & 2, pp. 688–691 (2008)

    Google Scholar 

  17. Saatchi, S., Hung, C.-C.: Hybridization of the Ant Colony Optimization with the K-Means Algorithm for Clustering. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 511–520. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Taher, N., Babak, A.: An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Applied Soft Computing 10, 183–197 (2010)

    Article  Google Scholar 

  19. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence 1(2), 224–227 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nadjet Kamel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kamel, N., Boucheta, R. (2014). A New Clustering Algorithm Based on Chameleon Army Strategy. In: Boonkrong, S., Unger, H., Meesad, P. (eds) Recent Advances in Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 265. Springer, Cham. https://doi.org/10.1007/978-3-319-06538-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06538-0_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06537-3

  • Online ISBN: 978-3-319-06538-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics