Uncovering and reducing hidden combinatorics in guigues-duquenne bases

Authors:
A. Gély;R. Medina;L. Nourine;Y. Renaud
Affiliations:
LIMOS, Université Blaise Pascal, Aubière, France;LIMOS, Université Blaise Pascal, Aubière, France;LIMOS, Université Blaise Pascal, Aubière, France;LIMOS, Université Blaise Pascal, Aubière, France
Venue:
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Year:
2005

Citing 3
Cited 5

On the complexity of inferring functional dependencies

Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Hypergraph Transversal Computation and Related Problems in Logic and AI

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence

About the lossless reduction of the minimal generator family of a context

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Succinct system of minimal generators: a thorough study, limitations and new definitions

CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
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
Interactive association rules discovery

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mannila and Räihä [5] have shown that minimum implicational bases can have an exponential number of implications. Aim of our paper is to understand how and why this combinatorial explosion arises and to propose mechanisms which reduce it.