Functional dependencies in relational databases: a lattice point of view
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
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
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Algorithms for association rule mining — a general survey and comparison
ACM SIGKDD Explorations Newsletter
ACM SIGKDD Explorations Newsletter
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Theory of Relational Databases
Theory of Relational Databases
Uncovering and reducing hidden combinatorics in guigues-duquenne bases
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Succinct system of minimal generators: a thorough study, limitations and new definitions
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
| Hi-index | 0.00 |
An interactive discovery method for finding association rules is presented. It consists in a user-guided search using reduction operators on a rule. Rules are generated on-demand according to the navigation made by the user. Main interest of this approach is that, at each step, the user has only a linear number of new rules to analyze and that all computations are done in polynomial time. Several reduction operators are presented. We also show that the search space can be reduced when clone items are present.