Generalizing Knowledge in Decentralized Rule-Based Models
Knowledge generalization of ruled-based models, such as decision trees or decision rules, have emerged from different backgrounds. This particular kind of models, given their interpretability, offer several possibilities to be combined. Despite each distinct context, common patterns have emerged revealing the systemic nature of the problem. In this paper, we look at the problem of generalizing the knowledge contained in a set of models as a process formalizing the operations that can be addressed in alternative ways. We also include a set-up to evaluate generalized models based on their ability to replace the base ones from a predictive performance perspective, without loss of interpretability.
KeywordsKnowledge generalization Rule-based models
- 1.Andrzejak, A., Langner, F., Zabala, S.: Interpretable models from distributed data via merging of decision trees. In: Proceedings of the 2013 IEEE Symposium on Computational Intelligence and Data Mining. IEEE (2013)Google Scholar
- 2.Bursteinas, B., Long, J.: Merging distributed classifiers. In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (2001)Google Scholar
- 4.Hall, L., Chawla, N., Bowyer, K.: Combining decision trees learned in parallel. In: Working Notes of the KDD-97 Workshop on Distributed Data Mining, pp. 10–15 (1998)Google Scholar
- 9.Quinlan, J.: Induction of decision trees. Mach. Learn. 1(1), 81–106 (1986)Google Scholar
- 15.Williams, G.: Inducing and combining multiple decision trees. Ph.D. thesis, Australian National University (1990)Google Scholar