Constrained-Based Closed Pattern Mining in n-ary Relations - Archive ouverte HAL Accéder directement au contenu
Poster De Conférence Année : 2008

Constrained-Based Closed Pattern Mining in n-ary Relations

Résumé

Many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to n-ary relations may be important for many applications, e.g., when adding the time dimension to the popular objects X features binary case. The generality of the task - no assumption being made on the relation arity or on the size of its attribute domains - makes it computationally challenging. From a n-ary relation, our algorithm extracts all closed n-sets satisfying given piecewise (anti)-monotonic constraints.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01501377 , version 1

Citer

Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-François Boulicaut. Constrained-Based Closed Pattern Mining in n-ary Relations. SML - Spring Workshop on Mining and Learning 2008, May 2008, Traben-Trarbach, Germany. pp.1-1, 2008. ⟨hal-01501377⟩
108 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More