In this paper, we consider computational problems related to finding implications in an explicitly given formal context or via queries to an oracle. We are concerned with two types of problems: enumerating implications (or association rules) and finding a single implication satisfying certain conditions. We present complexity results for some of these problems and leave others open. The paper is not meant as a comprehensive survey, but rather as a subjective selection of interesting problems.
CITATION STYLE
Obiedkov, S. (2019). Learning implications from data and from queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11511 LNAI, pp. 32–44). Springer Verlag. https://doi.org/10.1007/978-3-030-21462-3_3
Mendeley helps you to discover research relevant for your work.