Skip to Main content Skip to Navigation
Conference papers

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

Peggy Cellier 1 Sébastien Ferré 1 Olivier Ridoux 1 Mireille Ducassé 1
1 LIS - Logical Information Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01119634
Contributor : Peggy Cellier <>
Submitted on : Monday, February 23, 2015 - 4:06:54 PM
Last modification on : Tuesday, July 7, 2020 - 11:38:14 AM

Identifiers

  • HAL Id : hal-01119634, version 1

Citation

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⟩

Share

Metrics

Record views

444