An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A New Approach to Online Generation of Association Rules
IEEE Transactions on Knowledge and Data Engineering
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Representative Association Rules
PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
Discovery of multivalued dependencies from relations
Intelligent Data Analysis
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
From concepts to concept lattice: a border algorithm for making covers explicit
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
A formal context for symmetric dependencies
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Formal and computational properties of the confidence boost of association rules
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.