Finding minimal rare itemsets in a depth-first manner - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Finding minimal rare itemsets in a depth-first manner

Laszlo Szathmary
  • Function : Author
  • PersonId : 830631
Petko Valtchev
Amedeo Napoli
Robert Godin
  • Function : Author
  • PersonId : 854703


Rare itemsets are an important sort of patterns that have a wide range of practical applications. Although mining rare patterns poses specific algorithmic problems, it is yet insufficiently studied. In a previous work, we proposed a levelwise approach for rare itemset mining. Here, we examine the benefits of depth-first methods for that task as such methods are known to outperform the levelwise ones in many practical cases.
No file

Dates and versions

hal-00769028 , version 1 (27-12-2012)


  • HAL Id : hal-00769028 , version 1


Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. Finding minimal rare itemsets in a depth-first manner. ECAI Workshop on Formal Concept Analysis for Artificial Intelligence (FCA4AI), Montpellier, 2012, Montpellier, France. pp.71-78. ⟨hal-00769028⟩
90 View
0 Download


Gmail Facebook Twitter LinkedIn More