Tackling closed pattern relevancy in n-ary relations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Tackling closed pattern relevancy in n-ary relations

Résumé

For the last decade, set pattern discovery from binary relations has been studied in depth. Today, many complete and efficient algorithms for frequent closed set mining are available. More recently, their extensions towards n-ary relation mining have been considered. In this paper, we consider the recent proposal for closed n-set pattern discovery and we discuss their relevancy. Indeed, starting with experiments on two real-life multidimensional data sets, we discuss the quality of the extracted local patterns thanks to an inside and outside perspective on the discovered closed n-sets. This original analysis enables to support the declarative specification of a priori relevant patterns thanks to the conjunction of primitive constraints (minimal size, minimal area, delta-isolated and fault-tolerance constraints) they have to satisfy. Interestingly, some of these primitive constraints can be exploited within available solvers.
Fichier non déposé

Dates et versions

hal-01501899 , version 1 (04-04-2017)

Identifiants

  • HAL Id : hal-01501899 , version 1

Citer

Jérémy Besson, Loïc Cerf, Rémi Thevenoux, Jean-François Boulicaut. Tackling closed pattern relevancy in n-ary relations. Workshop Mining Multidimensional Data MMD'08 co-located with ECML PKDD 2008, Jan 2008, Antwerp, Belgium. pp.2-16. ⟨hal-01501899⟩
94 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More