[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Clustering Problem Using Adaptive Genetic Algorithm

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

  • 1761 Accesses

Abstract

Clustering is very important to data analysis and data minig. The K-Means algorithm, one of the partitional clustering approaches, is an iterative clustering technique that has been applied to many practical clustering problems successfully. However, the K-Means algorithm suffers from several drawbacks. In this paper, an adaptive genetic algorithm be present , it solve disadvantages of K-Means by combine parallel genetic algorithm, evolving flow and adaptive. Experimental results show that the adaptive genetic algorithm have advantages over traditional Clustering algorithm.

The Project Supported by Zhejiang Provincial Science Foundation of China (601081) and Key Lab of Information Processes of Jiangsu Province(Suzhou University).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics 24(3), 656–667 (1994)

    Article  Google Scholar 

  3. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)

    MATH  Google Scholar 

  4. Dumitrescu, D., Lazzerini, B., Jain, L.C., Dumitrescu, A.: Evolutionary Computation, pp. 223–224. CRC Press, Boca Raton (2000)

    MATH  Google Scholar 

  5. Hansen, P., Mladenovic, N.: J-MEANS: a new local search heuristic for minimum sum of squares clustering. Pattern Recognition 34, 405–413 (2001)

    Article  MATH  Google Scholar 

  6. Merz, C., Murphy, P., Aha, D.: UCI repository of Machine Learning databases. Dept. of Information and Computer Science, University of California, Irvine (1997)

    Google Scholar 

  7. http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Q., Han, J., Lai, Y., He, W., Mao, K. (2005). Clustering Problem Using Adaptive Genetic Algorithm. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_96

Download citation

  • DOI: https://doi.org/10.1007/11539902_96

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics