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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cannon, A., Cowen, L.: Approximation Algorithms for the Class Cover Problem. Annals of Mathematics and Artificial Intelligence 40(3), 215–223 (2004)
David, J.M., Carey, E.P.: Characterizing the Scale Dimension of a High Dimensional Classification Problem. Pattern Recognition 36(1), 45–60 (2003)
Priebe, C.E., Marchette, D.J., DeVinney, J., Socolinsky, D.: Classification using Class Cover Catch Digraphs. Journal of Classification 20(1), 3–23 (2003)
Abhay, K.P.: Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs. Information Processing Letters 39(5), 237–240 (1991)
Yanxin, H., Chunguang, Z.: Recognizing Taste Signals Using A Clustering-based Fuzzy Neural Network. Chinese Journal of Electronics 14(1), 21–25 (2005)
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)
Van Den Bergh, F.: An Analysis of Particle Swarm Optimizers [PH.D thesis]. Pretoria: Natural and Agricultural Science Department, University of Pretoria (2001)
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)
Zhengzhi, W., Tao, B.: Evolutionary Computation, Chang Sha, China, pp. 26–37. National University of Defense Technology Press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)