Abstract
We present a methodology for constructing an ensemble of rule base classifiers characterized not only by a good accuracy of classification but also by a good quality of knowledge representation. The base classifiers forming the ensemble are composed of minimal sets of rules that cover training objects, while being relevant for their high support, low anti-support and high Bayesian confirmation measure. The population of base classifiers is evolving in course of a bi-objective optimization procedure that involves accuracy of classification and diversity of base classifiers. The final population constitutes an ensemble classifier enjoying some desirable properties, as shown in a computational experiment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Błaszczyńki, J., Greco, S., Słowiński, R., Szeląg, M.: Monotonic variable consistency rough set approaches. Int. J. Approximate Reasoning 50(7), 979–999 (2009)
Błaszczyński, J., Słowiński, R., Stefanowski, J.: Variable consistency bagging ensembles. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets XI. LNCS, vol. 5946, pp. 40–52. Springer, Heidelberg (2010)
Błaszczyński, J., Słowiński, R., Stefanowski, J.: Ordinal classification with monotonicity constraints by variable consistency bagging. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol. 6086, pp. 392–401. Springer, Heidelberg (2010)
Błaszczyńki, J., Greco, S., Słowińki, R., Szeląg, M.: Sequential covering rule induction algorithm for variable consistency rough set approaches. Inf. Sci. 181(5), 987–1002 (2011)
Błaszczyński, J., Greco, S., Słowiński, R.: Inductive discovery of laws using monotonic rules. Eng. Appl. Artif. Intell. 25, 284–294 (2012)
Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123–140 (1996)
Chen, H., Yao, X.: Multiobjective neural network ensembles based on regularized negative correlation learning. IEEE Trans. Knowl. Data Eng. 22(12), 1738–1751 (2010)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Efron, B.: Nonparametric estimates of standard error: the jackknife, the bootstrap and other methods. Biometrika 68, 589–599 (1981)
Greco, S., Matarazzo, B., Słowiński, R.: Rough sets theory for multicriteria decision analysis. Eur. J. Oper. Res. 129(1), 1–47 (2001)
Gu, S., Jin, Y.: Generating diverse and accurate classifier ensembles using multi-objective optimization. In: Proceedings of IEEE MCDM 2014, pp. 9–15 (2015)
Kuncheva, L., Whitaker, C.: Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Mach. Learn. 51(2), 181–207 (2003)
Kuncheva, L.: Combining Pattern Classifiers. Methods and Algorithms. Wiley, Hoboken (2004)
Słowiński, R., Greco, S., Matarazzo, B.: Rough set methodology for decision aiding. In: Kacprzyk, J., Pedrycz, W. (eds.) Handbook of Computational Intelligence, pp. 349–370. Springer, Berlin (2015). Chapter 22
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Błaszczyński, J., Prusak, B., Słowiński, R. (2016). Multi-objective Search for Comprehensible Rule Ensembles. In: Flores, V., et al. Rough Sets. IJCRS 2016. Lecture Notes in Computer Science(), vol 9920. Springer, Cham. https://doi.org/10.1007/978-3-319-47160-0_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-47160-0_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47159-4
Online ISBN: 978-3-319-47160-0
eBook Packages: Computer ScienceComputer Science (R0)