Gradual Discovery with Closure Structure of a Concept Lattice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Gradual Discovery with Closure Structure of a Concept Lattice

Résumé

An approximate discovery of closed itemsets is usually based on either setting a frequency threshold or computing a sequence of projections. Both approaches, being incremental, do not provide any estimate of the size of the next output and do not ensure that "more interesting patterns" will be generated first. We propose to generate closed item-sets incrementally, w.r.t. the size of the smallest (cardinality-minimal or minimum) generators and show that this approach (i) exhibits anytime property, and (ii) generates itemsets of decreasing quality.
Fichier principal
Vignette du fichier
CLA_2020_paper_19.pdf (817.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02915309 , version 1 (14-08-2020)

Identifiants

  • HAL Id : hal-02915309 , version 1

Citer

Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli. Gradual Discovery with Closure Structure of a Concept Lattice. The 15th International Conference on Concept Lattices and Their Applications, Jun 2020, Tallinn, Estonia. ⟨hal-02915309⟩
99 Consultations
44 Téléchargements

Partager

Gmail Facebook X LinkedIn More