Skip to main content

A Modified and Efficient Shuffled Frog Leaping Algorithm (MSFLA) for Unsupervised Data Clustering

  • Conference paper
Advances in Computing and Communications (ACC 2011)

Abstract

Shuffled frog leaping Algorithm (SFLA) is a new memetic, population based, meta-heuristic algorithm, has emerged as one of the fast, robust with efficient global search capability. In order to enhance the algorithm’s stability and the ability to search the global optimum, the conventional SFL Algorithm has been modified in our work by using the local best value of each memeplex instead of generating a new frog, to enhance the effectiveness of the SFLA. This paper implements the application of Modified SFLA in Partitional clustering of the unlabelled data. This algorithm is applied on various classification problems and the simulated results demonstrate that, this modified SFLA has outperformed the conventional SFL Algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Moscato, P.: On evolution, search, optimization, GAs and martial arts: toward memetic algorithms, California Inst. Technol., Pasadena, CA, Tech. Rep. Caltech Concurrent Comput. Prog. Rep. 826 (1989)

    Google Scholar 

  2. Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary-based optimization algorithms. Advanced Engineering Informatics (19), 43–53 (2005)

    Google Scholar 

  3. Eusuff, M.M., Lansey, K.E., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Engineering Optimization 38(2), 129–154 (2006)

    Article  MathSciNet  Google Scholar 

  4. Liong, S.-Y., Atiquzzaman, M.: Optimal design of water distribution network using shuffled complex evolution. J. Inst. Eng. 44(1), 93–107 (2004)

    Google Scholar 

  5. Rao, M.R.: Cluster analysis and mathematical programming. Amer. Stat. Assoc., J. 66(335), 622–626 (1971)

    Article  MATH  Google Scholar 

  6. Abraham, A., Das, S., Roy, S.: Swarm Intelligence Algorithms for Data Clustering

    Google Scholar 

  7. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review

    Google Scholar 

  8. Rao, M.R.: Cluster analysis and mathematical programming. Amer. Stat. Assoc., J. 66(335), 622–626 (1971)

    Article  MATH  Google Scholar 

  9. Dasgupta, D.: An overview of artificial immune systems and their applications. Artificial Immune System and Their applications (1999b)

    Google Scholar 

  10. Zhen, Z., Wang, D., Liu, Y.: Improved Shuffled Frog Leaping Algorithm for Continuous Optimization Problem. In: 2009 IEEE Congress on Evolutionary Computation, CEC 2009 (2009)

    Google Scholar 

  11. Xue-Hui, L., Ye, Y., Xia, L.: Solving TSP with Shuffled Frog-Leaping Algorithm. In: Eighth International Conference on Intelligent Systems Design and Applications

    Google Scholar 

  12. Zhang, X., Hu, X., Cui, G., Wang, Y., Niu, Y.: An Improved Shuffled Frog Leaping Algorithm with Cognitive Behavior. In: Proceedings of the 7th World Congress on Intelligent Control and Automation, Chongqing, China, June 25-27 (2008)

    Google Scholar 

  13. De Castro, L.N., Von Zuben, F.J.: Learning and Optimization using the clonal selection principle. J. IEEE Transactions on Evolutionary Computation 6(3), 239–251 (2002)

    Article  Google Scholar 

  14. Naveen, I.G., Hali, Dessouki, E., Nahed, Mervat, A.N., Bakrawi, L.: Exponential Particle Swarm Optimization Approach for Improving Data Clustering. International Journal of Electrical and Electronics Engineering

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chittineni, S., Godavarthi, D., Pradeep, A.N.S., Satapathy, S.C., Reddy, P.V.G.D.P. (2011). A Modified and Efficient Shuffled Frog Leaping Algorithm (MSFLA) for Unsupervised Data Clustering. In: Abraham, A., Mauri, J.L., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22720-2_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22720-2_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22719-6

  • Online ISBN: 978-3-642-22720-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics