Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Maximal and stochastic Galois lattices
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
Theory of Relational Databases
Theory of Relational Databases
Semantic sampling of existing databases through informative Armstrong databases
Information Systems
Mining association rules in very large clustered domains
Information Systems
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Concept analysis via rough set and AFS algebra
Information Sciences: an International Journal
Relations and functions in multiset context
Information Sciences: an International Journal
Granular reduction of property-oriented concept lattices
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Mining gene expression data with pattern structures in formal concept analysis
Information Sciences: an International Journal
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
What is a fuzzy concept lattice? II
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
A completeness analysis of frequent weighted concept lattices and their algebraic properties
Data & Knowledge Engineering
| Hi-index | 0.07 |
This paper provides a representation theorem of lattices using many-valued relations. We show that any many-valued relation can be associated to a unique lattice which is a meet-sublattice of a product of chains. Conversely, to any lattice we can associate a many-valued relation such that its associated lattice is isomorphic to the initial one. Thereby, we obtain a representation theorem of lattices using many-valued relations. Moreover, since several many-valued relations might have the same associated lattice, we give a characterization of the minimal many-valued relation that can be associated to a lattice. We then sketch a polynomial time algorithm which computes such a minimal relation from either a lattice or an arbitrary relation. This representation presents several advantages: it is smaller than the usual binary representation; all known reconstruction algorithms working on binary relation can be used without loss of efficiency; it can be used by existing data mining processes.