Skip to main content

LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2006)

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

Abstract

The generalization performance of LS-SVM depends on a good setting of its parameters. Chaotic particle swarm optimization (CPSO) with simulated annealing algorithm (SACPSO) is proposed to choose the parameters of LS-SVM automatically. CPSO adopts chaotic mapping with certainty, ergodicity and the stochastic property, possessing high search efficiency. SA algorithm employs certain probability to improve the ability of PSO to escape from a local optimum. The results show that the proposed approach has a better generalization performance and is more effective than LS-SVM based on particle swarm optimization.

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

  • Vapnik, V.N.: The nature of statistical learning theory. Springer, New York (1995)

    MATH  Google Scholar 

  • Suykens, J.A.K., Vandewalle, J.: Least squares support vector machine classifiers. Neural Processing Letters 9, 293–300 (1999)

    Article  MathSciNet  Google Scholar 

  • Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceeding of the 1995 IEEE international conference on neural network, pp. 1942–1948 (1995)

    Google Scholar 

  • Eberthart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceeding of the sixth international symposium on micro machine and human science, pp. 39–43 (1995)

    Google Scholar 

  • Yi, D., Ge, X.R.: An improved PSO-based ANN with simulated annealing technique. Neuro-computing 63, 527–533 (2005)

    Google Scholar 

  • Zhang, C.K., Shao, H.H.: An ANN’s evolved by a new evolutionary system and its application. In: Proceedings of the 39th IEEE conference on decision and control, Sydney, Australia, pp. 3562–3563 (2000)

    Google Scholar 

  • Shi, Y., Eberhart, R.: Empirical study of particle swarm optimization. In: Proceedings of congress on evolutionary computation, pp. 1945–1950 (1999)

    Google Scholar 

  • Jiang, C.W., Etorre, B.: A self-adaptive chaotic particle swarm algorithm for short term hydroelectric system scheduling in deregulated environment. Energy Conversion and Management 46, 2689–2696 (2005)

    Article  Google Scholar 

  • Eberhart, R., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceeding of the 2001 IEEE International Conference on evolutionary computation, pp. 81–86 (2001)

    Google Scholar 

  • Balram, S.: Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem. Computers and Chemical Engineering 28, 1849–1871 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Al., Wu, Zm., Yang, Gk. (2006). LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_9

Download citation

  • DOI: https://doi.org/10.1007/11750321_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34021-8

  • Online ISBN: 978-3-540-34022-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics