Concepts Can't Afford to Stammer - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2003

Concepts Can't Afford to Stammer

Abstract

Generating concepts defined by a binary relation between a set P of properties and a set O of objects is one of the important current problems encountered in Data Mining. We present a new algorithmic process which generates each concept exactly once, using graph-theoretic results. We present two associated algorithms, both with a good worst-time complexity analysis, which make them competitive with the best existing algorithms. This process has a time complexity of O(|P|.m) per maximal chain of the concept lattice, where m denotes the size of the complement of the relation, and uses a data structure which is of small polynomial size. Our algorithms can be used to compute the edges of the lattice as well as to generate only frequent sets.
Fichier principal
Vignette du fichier
03jimco.pdf (259.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00269636 , version 1 (10-11-2022)

Identifiers

  • HAL Id : lirmm-00269636 , version 1

Cite

Anne Berry, Jean-Paul Bordat, Alain Sigayret. Concepts Can't Afford to Stammer. JIM 2003 - 4èmes Journées Informatiques Messines, Sep 2003, Metz, France. ⟨lirmm-00269636⟩
59 View
202 Download

Share

Gmail Facebook X LinkedIn More