Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On automatic class insertion with overloading
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Design of class hierarchies based on concept (Galois) lattices
Theory and Practice of Object Systems - Special issue high availability in CORBA
Efficient mining of association rules using closed itemset lattices
Information Systems
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Generating non-redundant association rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Data mining: concepts and techniques
Data mining: concepts and techniques
Mining frequent patterns with counting inference
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Data Mining and Knowledge Discovery
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Automatic Structuring of Knowledge Bases by Conceptual Clustering
IEEE Transactions on Knowledge and Data Engineering
Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Conceptual Information Systems Discussed through in IT-Security Tool
EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
An Algorithm for Insertion into a Lattice: Application to Type Classification
FOFO '89 Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
CEM - A Conceptual Email Manager
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Conceptual Knowledge Discovery and Data Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Formal Concept Analysis on Its Way from Mathematics to Computer Science
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Merging Inheritance Hierarchies for Database Integration
COOPIS '98 Proceedings of the 3rd IFCIS International Conference on Cooperative 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
Towards an Object Database Approach for Managing Concept Lattices
ER '97 Proceedings of the 16th International Conference on Conceptual Modeling
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
CL '00 Proceedings of the First International Conference on Computational Logic
TOSCANA - a Graphical Tool for Analyzing and Exploring Data
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
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
Mining Bases for Association Rules Using Closed Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
An Exploration into the Power of Formal Concept Analysis for Domestic Violence Analysis
ICDM '08 Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects
Treatment of L-Fuzzy contexts with absent values
Information Sciences: an International Journal
Short Communication: Concept lattice reduction using fuzzy K-Means clustering
Expert Systems with Applications: An International Journal
Analysis of social communities with iceberg and stability-based concept lattices
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Formal concept analysis and lattice-valued Chu systems
Fuzzy Sets and Systems
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data
Proceedings of the seventh international conference on Knowledge capture
Exploring Users' Preferences in a Fuzzy Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Formal Concept Analysis is an unsupervised learning technique for conceptual clustering. We introduce the notion of iceberg concept lattices and show their use in Knowledge Discovery in Databases (KDD). Iceberg lattices are designed for analyzing very large databases. In particular they serve as a condensed representation of frequent patterns as known from association rule mining.In order to show the interplay between Formal Concept Analysis and association rule mining, we discuss the algorithm TITANIC. We show that iceberg concept lattices are a starting point for computing condensed sets of association rules without loss of information, and are a visualization method for the resulting rules.