Towards Finding Relational Redescriptions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Towards Finding Relational Redescriptions

Résumé

This paper introduces relational redescription mining, that is, the task of finding two structurally different patterns that describe nearly the same set of object tuples in a relational dataset. By extending redescription mining beyond propositional and real-valued attributes, it provides a powerful tool to match different relational descriptions of the same concept. As a first step towards solving this general task, we introduce an efficient algorithm that mines one description of a given binary concept. A set of graph patterns is built from frequent path patterns connecting example pairs. Experiments in the domain of explaining kinship terms show that this approach can produce complex descriptions that match explanations by domain experts, while being much faster than a direct relational query mining approach.
Fichier principal
Vignette du fichier
GK12_towards.pdf (561.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01399271 , version 1 (25-05-2018)

Identifiants

Citer

Esther Galbrun, Angelika Kimmig. Towards Finding Relational Redescriptions. Proceedings of the 15th International Conference on Discovery Science, DS'12, Oct 2012, Lyon, France. ⟨10.1007/978-3-642-33492-4_7⟩. ⟨hal-01399271⟩
33 Consultations
74 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More