Attribute-incremental construction of the canonical implication basis

Authors:
S. Obiedkov;V. Duquenne
Affiliations:
Department of Applied Mathematics, Higher School of Economics, Moscow, Russia 105 679;CNRS UMR 7090, ECP6, Paris, France 75013
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2007

Citing 6
Cited 7

Minimal representation of directed hypergraphs

SIAM Journal on Computing
The design of relational databases

The design of relational databases
On the irredundant generation of knowledge spaces

Journal of Mathematical Psychology
A lattice conceptual clustering system and its application to browsing retrieval

Machine Learning
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Theory of Relational Databases

Theory of Relational Databases

Some Computational Problems Related to Pseudo-intents

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Towards the Complexity of Recognizing Pseudo-intents

ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
On the complexity of enumerating pseudo-intents

Discrete Applied Mathematics
Some complexity results about essential closed sets

ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Extraction of feature models from formal contexts

Proceedings of the 15th International Software Product Line Conference, Volume 2
Hardness of enumerating pseudo-intents in the lectic order

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Detecting mistakes in binary data tables

Automatic Documentation and Mathematical Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new algorithm constructing the canonical implication basis of a formal context. Being incremental, the algorithm processes a single attribute of the context at a single step. Experimental results bear witness to its competitiveness.