language: en

Discovering Compressive Partial Determinations in Mixed Numerical and Symbolic Domains

Bernhard Pfahringer and Stefan Kramer
Austrian Research Institute for Artificial Intelligence
Schottengasse 3 A-1010 Vienna, Austria
fbernhard, stefang@ai.univie.ac.at

Abstract Partial determinations are an interesting form of dependency between attributes in a relation. They generalize functional dependencies by allowing exceptions. We modify a known MDL formula for evaluating such partial determinations to allow for its use in an admissible heuristic in exhaustive search. Furthermore we describe an efficient preprocessing-based approach for handling numerical attributes. An empirical investigation tries to evaluate the viability of the presented ideas.

1 Introduction