An algorithm to find frequent concepts of a formal context with taxonomy

Authors:
Peggy Cellier;Sébastien Ferré;Olivier Ridoux;Mireille Ducassé
Affiliations:
IRISA, University of Rennes 1;IRISA, University of Rennes 1;IRISA, University of Rennes 1;IRISA, INSA, Rennes, France
Venue:
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Year:
2006

Citing 3
Cited 1

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Computing iceberg concept lattices with TITANIC

Data & Knowledge Engineering
Introduction to logical information systems

Information Processing and Management: an International Journal

A parameterized algorithm for exploring concept lattices

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis

Quantified Score

Hi-index	0.00

Visualization

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.