We present a general encoding scheme for a wide class of problems (including among others such problems like data reduction, feature selection, feature extraction, decision rules generation, pattern extraction from data or conflict resolution in multi-agent systems) and we show how to combine it with a propositional (Boolean) reasoning to develop efficient heuristics searching for (approximate) solutions of these problems. We illustrate our approach by examples, we show some experimental results and compare them with those reported in literature. We also show that association rule generation is strongly related with reduct approximation.
CITATION STYLE
Skowron, A., & Nguyen, H. S. (1999). Boolean reasoning scheme with some applications in data mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1704, pp. 107–115). Springer Verlag. https://doi.org/10.1007/978-3-540-48247-5_12
Mendeley helps you to discover research relevant for your work.