Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Real world performance of association rule algorithms
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
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
Scrutinizing Frequent Pattern Discovery Performance
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Distribution of Vertex Degree in Web-Graphs
Combinatorics, Probability and Computing
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns
Applied Intelligence
Min-Max itemset trees for dense and categorical datasets
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Hi-index | 0.00 |
We investigate the statistical properties of the databases generated by the IBM QUEST program. Motivated by the claim (also supported empirical evidence) that item occurrences in real life market basket databases follow a rather different pattern, we propose an alternative model for generating artificial data.