Incremental construction of alpha lattices and association rules

Authors:
Henry Soldano;Véronique Ventos;Marc Champesme;David Forge
Affiliations:
L.I.P.N, UMR, CNRS, Université Paris-Nord, Villetaneuse, France;LRI, UMR, CNRS, Université Paris-Sud, Orsay, France;L.I.P.N, UMR, CNRS, Université Paris-Nord, Villetaneuse, France;LRI, UMR, CNRS, Université Paris-Sud, Orsay, France
Venue:
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Year:
2010

Citing 10
Cited 2

Generating non-redundant association rules

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A partition-based approach towards constructing Galois (concept) lattices

Discrete Mathematics
Structural Machine Learning with Galois Lattice and Graphs

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods

ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Pattern Structures and Their Projections

ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Generating a Condensed Representation for Association Rules

Journal of Intelligent Information Systems
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

IEEE Transactions on Knowledge and Data Engineering
Efficient algorithms for mining frequent and closed patterns from semi-structured data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Alpha galois lattices: an overview

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

Abstract concept lattices

ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Applying the JBOS reduction method for relevant knowledge extraction

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover C of the powerset of the instance set I, and on a granularity parameter α. In this paper, we define and experiment a Merge operator that when applied to two Alpha lattices G(C1, α) and G(C2, α) generates the Alpha lattice G(C1∪C2, α), so leading to a class-incremental construction of Alpha lattices. We then briefly discuss the implementation of the incremental process and describe the min-max bases of association rules extracted from Alpha lattices.