Skip to main content

A Hybrid CRO-K-Means Algorithm for Data Clustering

  • Conference paper
  • First Online:
  • 1422 Accesses

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 33))

Abstract

Over the past few decades clustering algorithms have been used in diversified fields of engineering and science. Out of various methods, K-Means algorithm is one of the most popular clustering algorithms. However, K-Means algorithm has a major drawback of trapping to local optima. Motivated by this, this paper attempts to hybridize Chemical Reaction Optimization (CRO) algorithm with K-Means algorithm for data clustering. In this method K-Means algorithm is used as an on-wall ineffective collision reaction in the CRO algorithm, thereby enjoying the intensification property of K-Means algorithm and diversification of intermolecular reactions of CRO algorithm. The performance of the proposed methodology is evaluated by comparing the obtained results on four real world datasets with three other algorithms including K-Means algorithm, CRO-based and differential evolution (DE) based clustering algorithm. Experimental result shows that the performance of proposed clustering algorithm is better than K-Means, DE-based, CRO-based clustering algorithm on the datasets considered.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31, 264–323 (1999)

    Article  Google Scholar 

  2. Jain, S., Gajbhiye, S.: A Comparative performance analysis of clustering algorithms. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 2, 441–445 (2012)

    Google Scholar 

  3. Abbas, O.A.: Comparisons between data clustering algorithms. Int. Arab J. Inf. Technol. 5, 320–325 (2008)

    Google Scholar 

  4. Dash, R., Mishra, D., Rath, A.K., Acharya, M.: A hybridized K-means clustering algorithm for high dimensional dataset. Int. J. Comput. Sci. Technol. 2, 59–66 (2010)

    Google Scholar 

  5. Yedla, M., Pathakota, S.R., Srinivasa, T.M.: Enhancing K means algorithm with improved initial center. Int. J. Comput. Sci. Inf. Technol. 1, 121–125 (2010)

    Google Scholar 

  6. Fahim, A.M., Salem, A.M., Torkey, F.A., Ramadan, M.A., Saake, G.: An efficient K-means with good initial starting points. Georgian Electron. Sci. J. Comput. Sci. Telecommun. 2, 47–57 (2009)

    Google Scholar 

  7. Zhang, C., Xia, S.: K-means clustering algorithm with improved initial center. In: Second International Workshop on Knowledge Discovery and Data Mining, WKDD, pp. 790–792 (2009)

    Google Scholar 

  8. Storn, R., Price, K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  10. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  11. Socha, K., Doringo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185, 1155–1173 (2008)

    Article  MATH  Google Scholar 

  12. Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm—a novel tool for complex optimization problems. In: Proceedings of 2nd International Virtual Conference on Intelligent Production Machines and Systems, pp. 454–459 (2006)

    Google Scholar 

  13. Beyer, H.G., Schwefel, H.P.: Evolutionary strategies: a comprehensive introduction. Nat. Comput. 1, 3–52 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6, 580–593 (2002)

    Article  Google Scholar 

  15. Lam, A.Y.S., Li, V.O.K.: Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans. Evol. Comput. 14, 381–399 (2010)

    Article  Google Scholar 

  16. Lam, A.Y.S.: Real-coded chemical reaction optimization. IEEE Trans. Evol. Comput. 16, 339–353 (2012)

    Article  Google Scholar 

  17. Alatas, B.: ACROA: artificial chemical reaction optimization algorithm for global optimization. Expert Syst. Appl. 38, 13170–13180 (2011)

    Article  Google Scholar 

  18. Al-Shboul, B., Myaeng, S.: Initializing K-means clustering algorithm by using genetic algorithm. World Acad. Sci. Eng. Technol. 54, 114–118 (2009)

    Google Scholar 

  19. Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recogn. 33, 1455–1465 (2000)

    Article  Google Scholar 

  20. Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on K-means algorithm for optimal clustering in RN. Inf. Sci. 146, 221–237 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Paterlini, S., Krink, T.: High performance clustering with differential evolution. evolutionary computation. In: CEC2004, vol. 2, pp. 2004–2011 (2004)

    Google Scholar 

  22. Satapathy, S.C., Naik, A.: Data clustering based on teaching-learning-based optimization. In: Swarm, Evolutionary and Memetic Computing Conference Part II, LNCS, vol. 7077, pp. 148–156 (2011)

    Google Scholar 

  23. Naik, A., Satapathy, S.C., Parvathi, K.: Improvement of initial cluster center of c-means using teaching learning based optimization. Procedia Technol. 6, 428–435 (2012)

    Article  Google Scholar 

  24. Das, S., Suganthanam, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15, 4–31 (2011)

    Article  Google Scholar 

  25. Sahu, K.K., Panigrahi, S., Behera, H.S.: A novel chemical reaction optimization algorithm for higher order neural network training. J. Theoret. Appl. Inf. Technol. 53, 402–409 (2013)

    Google Scholar 

  26. Baral, A., Behera, H.S.: A novel chemical reaction-based clustering and its performance analysis. Int. J. Bus. Intell. Data Min. 8, 184–198 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sibarama Panigrahi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Panigrahi, S., Rath, B., Santosh Kumar, P. (2015). A Hybrid CRO-K-Means Algorithm for Data Clustering. In: Jain, L., Behera, H., Mandal, J., Mohapatra, D. (eds) Computational Intelligence in Data Mining - Volume 3. Smart Innovation, Systems and Technologies, vol 33. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2202-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2202-6_57

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2201-9

  • Online ISBN: 978-81-322-2202-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics