Abstract
The minimal test cost attribute reduction is an important component in data mining applications, and plays a key role in cost-sensitive learning. Recently, several algorithms are proposed to address this problem, and can get acceptable results in most cases. However, the effectiveness of the algorithms for large datasets are often unacceptable. In this paper, we propose a global best artificial bee colony algorithm with an improved solution search equation for minimizing the test cost of attribute reduction. The solution search equation introduces a parameter associated with the current global optimal solution to enhance the local search ability. We apply our algorithm to four UCI datasets. The result reveals that the improvement of our algorithm tends to be obvious on most datasets tested. Specifically, the algorithm is effective on large dataset Mushroom. In addition, compared to the information gain-based reduction algorithm and the ant colony optimization algorithm, the results demonstrate that our algorithm has more effectiveness, and is thus more practical.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Fumera, G., Roli, F.: Cost-sensitive learning in support vector machines. In: Proceedings of VIII Convegno Associazione Italiana per L’ Intelligenza Artificiale (2002)
Ling, C.X., Yang, Q., Wang, J.N., Zhang, S.C.: Decision trees with minimal costs. In: Proceedings of the 21st International Conference on Machine Learning, p. 69 (2004)
Xu, Z., Min, F., Liu, J., Zhu, W.: Ant colony optimization to minimal test cost reduction. In: 2012 IEEE International Conference on Granular Computing (GrC), pp. 585–590. IEEE (2012)
Min, F., He, H.P., Qian, Y.H., Zhu, W.: Test-cost-sensitive attribute reduction. Information Sciences 181, 4928–4942 (2011)
Karaboga, D., Akay, B.: A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214(1), 108–132 (2009)
Johnson, N., Kotz, S.: Continuous distributions. J. Wiley, New York (1970) ISBN: 0-471-44626-2
Johnson, R., Wichern, D.: Applied multivariate statistical analysis, vol. 4. Prentice Hall, Englewood Cliffs (1992)
Min, F., Zhu, W., Zhao, H., Xu, Z.L.: Coser: Cost-senstive rough sets (2012), http://grc.fjzs.edu.cn/~fmin/coser/
Min, F., Zhu, W.: Minimal cost attribute reduction through backtracking. In: Kim, T.-H., et al. (eds.) DTA/BSBT 2011. CCIS, vol. 258, pp. 100–107. Springer, Heidelberg (2011)
Susmaga, R.: Computation of minimal cost reducts. In: Raś, Z.W., Skowron, A. (eds.) ISMIS 1999. LNCS, vol. 1609, pp. 448–456. Springer, Heidelberg (1999)
Zhu, W.: A class of fuzzy rough sets based on coverings. In: Proceedings of Fuzzy Systems and Knowledge Discovery, vol. 5, pp. 7–11 (2007)
Pawlak, Z.: Rough sets and intelligent data analysis. Information Sciences 147(12), 1–12 (2002)
Min, F., Zhu, W.: Attribute reduction of data with error ranges and test costs. Information Sciences 211, 48–67 (2012)
Gao, W., Liu, S.: Improved artificial bee colony algorithm for global optimization. Information Processing Letters 111(17), 871–882 (2011)
Banharnsakun, A., Achalakul, T., Sirinaovakul, B.: The best-so-far selection in artificial bee colony algorithm. Applied Soft Computing 11(2), 2888–2901 (2011)
Cai, J., Ding, H., Zhu, W., Zhu, X.: Artificial bee colony algorithm to minimal time cost reduction. J. Comput. Inf. Systems 9(21), 8725–8734 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fan, A., Zhao, H., Zhu, W. (2014). Global Best Artificial Bee Colony for Minimal Test Cost Attribute Reduction. In: Miao, D., Pedrycz, W., Ślȩzak, D., Peters, G., Hu, Q., Wang, R. (eds) Rough Sets and Knowledge Technology. RSKT 2014. Lecture Notes in Computer Science(), vol 8818. Springer, Cham. https://doi.org/10.1007/978-3-319-11740-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-11740-9_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11739-3
Online ISBN: 978-3-319-11740-9
eBook Packages: Computer ScienceComputer Science (R0)