An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy

Peggy Cellier
Olivier Ridoux
Mireille Ducassé

Résumé

Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techniques produce a completed context with all attributes deduced from the taxonomy. Usual algorithms can then be applied on the completed context for finding frequent concepts, but the results systematically contain redundant information. This article describes an algorithm which allows the frequent concepts of a formal context with taxonomy to be computed. It works on a non-completed context and uses the taxonomy information when needed. The results avoid the redundancy problem with equivalent performance.
Fichier non déposé

Dates et versions

hal-01119634 , version 1 (23-02-2015)

Identifiants

  • HAL Id : hal-01119634 , version 1

Citer

Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé. An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy. International Conference on Concept Lattices and Their Applications, Oct 2006, Hammamet, Tunisia. ⟨hal-01119634⟩
180 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More