Sciweavers

Share
ICFCA
2007
Springer

A Parameterized Algorithm for Exploring Concept Lattices

11 years 7 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (respectively negative examples) are sets of frequent concepts with respect to a minimal support, whose extent contains only positive examples (respectively negative examples). In terms of association rules, the above learning can be seen as searching the premises of exact rules where the consequence is fixed. When augmented with statistical indicators like confidence and support it is possible to extract various kinds of concept-based rules taking into account exceptions. FCA considers attributes as a non-ordered set. When attributes of the context are ordered, Conceptual Scaling allows the related taxonomy to be taken into account by producing a context completed with all attributes deduced from the taxonomy. The drawback of that method is concept intents contain redundant information. In a previous work, ...
Peggy Cellier, Sébastien Ferré, Oliv
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICFCA
Authors Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé
Comments (0)
books