Constructing Iceberg Lattices from Frequent Closures Using Generators

Laszlo Szathmary 1, * Petko Valtchev 1 Amedeo Napoli 2 Robert Godin 1
* Corresponding author
2 ORPAILLEUR - Knowledge representation, reasonning
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their joint computation has been studied in concept analysis, no scalable algorithm exists for the task at present. We propose here to reverse a method from the latter field using a fundamental property of hypergraph theory. The goal is to extract the precedence relation from a more common mining output, i.e. closures and generators. The resulting order computation algorithm proves to be highly efficient, benefiting from peculiarities of generator families in typical mining datasets. Due to its genericity, the new algorithm fits an arbitrary FCI/FG-miner.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00331524
Contributor : Laszlo Szathmary <>
Submitted on : Friday, October 17, 2008 - 9:57:54 AM
Last modification on : Thursday, January 11, 2018 - 6:19:53 AM
Long-term archiving on : Tuesday, October 9, 2012 - 1:55:36 PM

File

szathmary_etal-ds08.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00331524, version 1

Collections

Citation

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. Constructing Iceberg Lattices from Frequent Closures Using Generators. 11th International Conference on Discovery Science - DS '08, Oct 2008, Budapest, Hungary. pp.136-147. ⟨inria-00331524⟩

Share

Metrics

Record views

254

Files downloads

190