From Sets of Good Redescriptions to Good Sets of Redescriptions

Janis Kalofolias (1) , Esther Galbrun (2) , Pauli Miettinen (1)

1 Max Planck Institute for Informatics [Saarbrücken]
2 ORPAILLEUR - Knowledge representation, reasonning

Redescription mining aims at finding pairs of queries over data variables that describe roughly the same set of observations. These redescriptions can be used to obtain different views on the same set of entities. So far, redescription mining methods have aimed at listing all redescriptions supported by the data. Such an approach can result in many redundant redescriptions and hinder the user's ability to understand the overall characteristics of the data. In this work, we present an approach to find a good set of redescriptions, instead of finding a set of good redescriptions. That is, we present a way to remove the redundant redescriptions from a given set of redescriptions. We measure the redundancy using a framework inspired by the subjective interestingness based on maximum-entropy distributions as proposed by De Bie in 2011. Redescriptions, however, raise their unique requirements on the framework, and our solution differs significantly from the existing ones. Notably, our approach can handle disjunctions and conjunctions in the queries, whereas the existing approaches are limited only to conjunctive queries. The framework also reduces the redundancy in the redescription mining results, as we show in our empirical evaluation.

Domaines: Intelligence artificielle [cs.AI]

Janis Kalofolias, Esther Galbrun, Pauli Miettinen. From Sets of Good Redescriptions to Good Sets of Redescriptions. ICDM’16 - 16th IEEE International Conference on Data Mining, Dec 2016, Barcelona, Spain. ⟨hal-01399294⟩