Abstract
Over the years we have seen considerable progress in learning rule-based theories. However, all state-of-the-art rule learners still learn descriptions that directly relate the input features to the target concept and are not able to discover intermediate concepts which might result in a more compact and interpretable theory. An analogous observation can also be made in electronic design automation where the task is to find the minimal representation of a Boolean function: if the representation is not limited to two levels, even smaller circuits can be found. In this paper, we consider binary classification tasks as multi-level logic optimization problems. We take DNF descriptions of the positive class, as obtained by state-of-the-art rule learners, and generate binary decision diagrams with the equivalent expression as the rule set. Finally, a new rule-based theory is extracted from the BDD, which includes new intermediate concepts and is therefore better structured than the original DNF rule set. First experiments on small artificial datasets indicate that intermediate concepts can be reliably detected, and the size of the resulting representations can be compressed, but a first study on a simple real-world dataset showed that the found structures are too complex to be interpretable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
For all rule sets, the attributes have been one-hot-encoded to meet the requirements for BDD processing.
References
Beck, F., Fürnkranz, J.: An empirical investigation into deep and shallow rule learning. Front. Artifi. Intell. 4, 145 (2021). https://doi.org/10.3389/frai.2021.689398
Biere, A., Heljanko, K., Wieringa, S.: AIGER 1.9 and beyond. Technical report 11/2, Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria (2011)
Bohanec, M., Rajkovic, V.: Knowledge acquisition and explanation for multi-attribute decision making. In: 8th International Workshop on Expert Systems and Their Applications, pp. 59–78 (1988)
Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: 27th ACM/IEEE Design Automation Conference, pp. 40–45. IEEE (1990)
Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.L.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers (1984)
Brayton, R.K., Rudell, R., Sangiovanni-Vincentelli, A., Wang, A.R.: MIS: a multiple-level logic optimization system. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 6(6), 1062–1081 (1987)
Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293–318 (1992)
Courbariaux, M., Bengio, Y., David, J.: BinaryConnect: training deep neural networks with binary weights during propagations. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems (NeurIPS), vol. 28, Montreal, Quebec, Canada, pp. 3123–3131 (2015)
Deng, Z.H., Lv, S.L.: PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424–5432 (2015)
Dua, D., Graff, C.: UCI machine learning repository (2017). http://archive.ics.uci.edu/ml
Džeroski, S., Cestnik, B., Petrovski, I.: Using the \(m\)-estimate in rule induction. J. Comput. Inf. Technol. 1, 37–46 (1993)
Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. Am. Inst. Electr. Eng. Part I: Commun. Electron. 72(5), 593–599 (1953)
Kohavi, R.: Bottom-up induction of oblivious read-once decision graphs. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol. 784, pp. 154–169. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-57868-4_56
Kramer, S.: A brief history of learning symbolic higher-level representations from data (and a curious look forward). In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), Survey Track, pp. 4868–4876 (2020)
Matheus, C.J.: A constructive induction framework. In: Proceedings of the 6th International Workshop on Machine Learning, pp. 474–475 (1989)
McCluskey, E.J.: Minimization of Boolean functions. Bell Syst. Tech. J. 35(6), 1417–1444 (1956). https://doi.org/10.1002/j.1538-7305.1956.tb03835.x
Miller, D.M.: Multiple-valued logic design tools. In: Proceedings of the 23rd International Symposium on Multiple-Valued Logic, pp. 2–11. IEEE (1993)
Miltersen, P.B., Radhakrishnan, J., Wegener, I.: On converting CNF to DNF. Theoret. Comput. Sci. 347(1–2), 325–335 (2005)
Muggleton, S.H.: Structuring knowledge by asking questions. In: Bratko, I., Lavrač, N. (eds.) Progress in Machine Learning, pp. 218–229. Sigma Press, Wilmslow (1987)
Muggleton, S.H.: Inverting the resolution principle. In: Hayes, J.E., Michie, D., Tyugu, E. (eds.) Machine Intelligence, vol. 12, chap. 7, pp. 93–103. Clarendon Press, Oxford (1991)
Muggleton, S.H., Lin, D., Tamaddoni-Nezhad, A.: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited. Mach. Learn. 100(1), 49–73 (2015)
Oliveira, A.L., Sangiovanni-Vincentelli, A.: Using the minimum description length principle to infer reduced ordered decision graphs. Mach. Learn. 25(1), 23–50 (1996)
Oliver, J.J.: Decision graphs – an extension of decision trees. In: Proceedings of the 4th International Workshop on Artificial Intelligence and Statistics, pp. 343–350 (1993)
Pagallo, G., Haussler, D.: Boolean feature discovery in empirical learning. Mach. Learn. 5, 71–99 (1990)
Pfahringer, B.: Controlling constructive induction in CIPF: an MDL approach. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol. 784, pp. 242–256. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-57868-4_62
Poon, H., Domingos, P.: Sum-product networks: a new deep architecture. In: 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), pp. 689–690. IEEE (2011)
Quinlan, J.R.: Generating production rules from decision trees. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87), pp. 304–307. Morgan Kaufmann (1987)
Rai, S., et al.: Logic synthesis meets machine learning: trading exactness for generalization. arXiV Preprint arXiV:2012.02530 (2020)
Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pp. 42–47. IEEE (1993)
Stahl, I.: Predicate invention in inductive logic programming. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, Frontiers in Artificial Intelligence and Applications, vol. 32, pp. 34–47. IOS Press (1996)
Stecher, J., Janssen, F., Fürnkranz, J.: Separating rule refinement and rule selection heuristics in inductive rule learning. In: Calders, T., Esposito, F., Hüllermeier, E., Meo, R. (eds.) ECML PKDD 2014, Part III. LNCS (LNAI), vol. 8726, pp. 114–129. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44845-8_8
Vreeken, J., van Leeuwen, M., Siebes, A.: KRIMP: mining itemsets that compress. Data Min. Knowl. Discov. 23(1), 169–214 (2011). https://doi.org/10.1007/s10618-010-0202-x. http://dx.doi.org/10.1007/ s10618-010-0202-x
Wnek, J., Michalski, R.S.: Hypothesis-driven constructive induction in AQ17-HCI: a method and experiments. Mach. Learn. 14(2), 139–168 (1994). Special Issue on Evaluating and Changing Representation
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Beck, F., Fürnkranz, J., Huynh, V.Q.P. (2021). Structuring Rule Sets Using Binary Decision Diagrams. In: Moschoyiannis, S., Peñaloza, R., Vanthienen, J., Soylu, A., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2021. Lecture Notes in Computer Science(), vol 12851. Springer, Cham. https://doi.org/10.1007/978-3-030-91167-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-91167-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91166-9
Online ISBN: 978-3-030-91167-6
eBook Packages: Computer ScienceComputer Science (R0)