iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/11881070_84
A Hybrid Algorithm for Solving Generalized Class Cover Problem | SpringerLink
Skip to main content

A Hybrid Algorithm for Solving Generalized Class Cover Problem

  • Conference paper
Advances in Natural Computation (ICNC 2006)

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

Included in the following conference series:

  • 984 Accesses

Abstract

A generalized class cover problem is presented in this article, and then reduced to a constrained multi-objective optimization problem. Solving this problem is significantly important to construct a robust classification system. Therefore, three algorithms for solving the generalized class cover problem are proposed, which are greedy algorithm, binary particle swarm optimization algorithm, and their hybrid algorithm. Comparison results of these three methods show that the hybrid algorithm can get better solutions in less runtime.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Cannon, A., Cowen, L.: Approximation Algorithms for the Class Cover Problem. Annals of Mathematics and Artificial Intelligence 40(3), 215–223 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. David, J.M., Carey, E.P.: Characterizing the Scale Dimension of a High Dimensional Classification Problem. Pattern Recognition 36(1), 45–60 (2003)

    Article  MATH  Google Scholar 

  3. Priebe, C.E., Marchette, D.J., DeVinney, J., Socolinsky, D.: Classification using Class Cover Catch Digraphs. Journal of Classification 20(1), 3–23 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Abhay, K.P.: Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs. Information Processing Letters 39(5), 237–240 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Yanxin, H., Chunguang, Z.: Recognizing Taste Signals Using A Clustering-based Fuzzy Neural Network. Chinese Journal of Electronics 14(1), 21–25 (2005)

    Google Scholar 

  6. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceeding of IEEE International Conference on Neural Networks, vol. IV, pp. 1942–1948. IEEE Press, Perth, Australia (1995)

    Chapter  Google Scholar 

  7. Van Den Bergh, F.: An Analysis of Particle Swarm Optimizers [PH.D thesis]. Pretoria: Natural and Agricultural Science Department, University of Pretoria (2001)

    Google Scholar 

  8. Kennedy, J., Eberhart, R.C.: A Discrete Binary Version of the Particle Swarm Algorithm. In: Proceedings of the 1997 Conference on Systems, Man, and Cybernetics, Piscataway, pp. 4104–4109. IEEE Press, Los Alamitos (1997)

    Google Scholar 

  9. Zhengzhi, W., Tao, B.: Evolutionary Computation, Chang Sha, China, pp. 26–37. National University of Defense Technology Press (2000)

    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

Huang, Y., Zhou, C., Wang, Y., Bao, Y., Wu, Y., Li, Y. (2006). A Hybrid Algorithm for Solving Generalized Class Cover Problem. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_84

Download citation

  • DOI: https://doi.org/10.1007/11881070_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45901-9

  • Online ISBN: 978-3-540-45902-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics