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 incremental concept formation approach for learning from databases
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Discrete Mathematics
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Assessing modular structure of legacy code based on mathematical concept analysis
ICSE '97 Proceedings of the 19th international conference on Software engineering
Generating non-redundant association rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Data mining for association rules and sequential patterns: sequential and parallel algorithms
Data mining for association rules and sequential patterns: sequential and parallel algorithms
Integration paradigm for data type and process specification techniques
Current trends in theoretical computer science
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Mining Constrained Association Rules to Predict Heart Disease
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Graph Grammar Engineering: A Software Specification Method
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
PROGRESS: A VHL-Language Based on Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
An Algebraic Theory of Graph Reduction
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Graph Grammars for Knowledge Representation
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Theory of Relational Databases
Theory of Relational Databases
Pair grammars, graph languages and string-to-graph translations
Journal of Computer and System Sciences
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
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
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We show that a formal concept lattice L, with explicit generators, constitutes a viable medium for discrete, deterministic, data mining. All implications of interest can be found and extracted from L independent of the frequency of their occurance.More importantly, we show that these lattices can be grown from a binary relation R one row, or observation, at a time using a transformation that is based on the mathematical properties of the generators and faces of closed sets. Incremental growth is orders of magnitude faster than existing methods which rely on global closure operators.