Generalized domination in closure systems

Authors:
Anne Berry;Eric SanJuan;Alain Sigayret
Affiliations:
LIMOS (CNRS UMR), Université Blaise Pascal, Ensemble Scientifique des Cézeaux, Aubiàre cedex, France;LITA (EA), Université Paul Verlaine de Metz, Ile du Saulcy, Metz cedex, France;LIMOS, Université Blaise Pascal, Ensemble Scientifique des Cézeaux, Aubiàre cedex, France
Venue:
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Year:
2006

Citing 11
Cited 0

Foundations of logic programming

Foundations of logic programming
LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

Information Processing Letters
Horn functions and their DNFs

Information Processing Letters
Building and maintaining analysis-level class hierarchies using Galois Lattices

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Using Lattice-Based Framework as a Tool for Feature Extraction

ECML '98 Proceedings of the 10th European Conference on Machine Learning
Efficiently Mining Maximal Frequent Itemsets

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Maintaining Class Membership Information

OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design

ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Representing a concept lattice by a graph

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Theory of Relational Databases

Theory of Relational Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of extracting maximal item sets and association rules from a binary data base, the graph-theoretic notion of domination was recently used to characterize the neighborhood of a concept in the corresponding lattice.In this paper, we show that the notion of domination can in fact be extended to any closure operator on a finite universe and be efficiently encoded into propositional Horn functions. This generalization enables us to endow notions and algorithms related to Formal Concept Analysis with Horn minimization and minimal covers of functional dependencies in Relational Databases.