Efficient mining of association rules using closed itemset lattices
Information Systems
Generating non-redundant association rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices
ECML '00 Proceedings of the 11th European Conference on Machine Learning
Structural Machine Learning with Galois Lattice and Graphs
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Conceptual Knowledge Discovery and Data Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
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
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Incremental construction of alpha lattices and association rules
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
A case study in a recommender system based on purchase data
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Formal concept analysis based on fuzzy granularity base for different granulations
Fuzzy Sets and Systems
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
What we propose here is to reduce the size of Galois lattices still conserving their formal structure and exhaustivity. For that purpose we use a preliminary partition of the instance set, representing the association of a “type” to each instance. By redefining the notion of extent of a term in order to cope, to a certain degree (denoted as α), with this partition, we define a particular family of Galois lattices denoted as Alpha Galois lattices. We also discuss the related implication rules defined as inclusion of such α-extents and show that Iceberg concept lattices are Alpha Galois lattices where the partition is reduced to one single class.