Constrained-Based Closed Pattern Mining in n-ary Relations - Archive ouverte HAL Access content directly
Poster Communications Year : 2008

Constrained-Based Closed Pattern Mining in n-ary Relations

Abstract

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-01501377 , version 1

Cite

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⟩
102 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More