Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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 association rules with multiple minimum supports
KDD '99 Proceedings of the fifth 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
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Weighted Association Rule Mining using weighted support and significance framework
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Hi-index | 0.00 |
In this paper, we propose an unique profit criterion as a new minimum support threshold for each item and exploit the criterion as multiple minimum supports in our algorithm. We then apply our profit-based association rule mining algorithm to generate large itemsets and show the result of our experiment. Experiment results carried on synthetic data set show that the proposed approach is efficient and effective in terms of reducing candidate itemsets and generating more profitable itemsets respectively.