Average-case performance of the Apriori Algorithm

SIAM Journal on Computing

Volumn 33, Issue 5, 2004, Pages 1223-1260

  Purdom, Paul W ^a   Van Gucht, Dirk ^a   Groth, Dennis P ^b  

^a INDIANA UNIVERSITY   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Algorithm analysis; Apriori algorithm; Data mining

Indexed keywords

ALGORITHM ANALYSIS; APRIORI ALGORITHMS; DATA SETS; RANDOM SHOPPERS;

ALGORITHMS; APPROXIMATION THEORY; CORRELATION METHODS; DATA MINING; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

PROBLEM SOLVING;

EID: 8344270132     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703422881     Document Type: Article

References (24)

1. R. C. AGRAWAL, C. C. AGGARWAL, AND V. PRASAD, Depth first generation of long patterns, in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000, pp. 108-118.
2. R. AGRAWAL, H. MANNILA, R. SRIKANT, H. TOIVONEN, AND A. I. VERKAMO, Fast discovery of association rules, in Advances in Knowledge Discovery and Data Mining, U. M. Elayyad, G. Piatesky-Shapiro, P. Smyth, and R. Uthurusamy, eds., MIT Press, Cambridge, MA, 1996, pp. 307-328.
3. R. AGRAWAL AND R. SRIKANT, Fast algorithms for mining association rules, in Proceedings of the 1994 Very Large Data Bases Conference, Morgan-Kaufmann, 1994, pp. 487-499.
4. R. BAYARDO, Efficiently mining long patterns from databases, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 1998, pp. 85-93.
5. S. BRIN, R. MOTWANI, AND C. SILVERSTEIN, Beyond market baskets: Generalizing association rules to correlations, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 1997, pp. 265-276.
6. S. BRIN, R. MOTWANI, J. D. ULLMAN, AND S. TSUR, Dynamic itemset counting and implication rules for market basket data, in Proceedings of the ACM SIGMOD Conference on Management of Data, 1997, pp. 255-264.
7. T. CALDERS. Axiomatization and Deduction Rules for the Frequency of Itemsets. Ph.D. Dissertation. University of Antwerp, 2003.
8. H. CHERNOFF, A measure of asymptotic efficiency for test of a hypothesis based on the sum of observations. Ann. Math. Statist., 23 (1942), pp. 493-507.
9. M. R. GAREY AND D. S. JOHNSON. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company. San Francisco. CA, 1979.
10. F. GEERTS, B. GOETHALS. AND J. VAN DEN BUSSCHE, A tight upper bound on the number of candidate patterns, in Proceedings of the 2001 IEEE International Conference on Data Mining, 2001, pp. 155-162.
11. D. P. GROTH AND E. L. ROBERTSON, Discovering frequent itemsets in the presence of highly frequent items, Rule Based Data Mining Workshop, in Conjunction with the 14th International Conference on Applications of Prolog, Springer-Verlag, New York. 2001. pp. 237-245.
12. J. HAN, J. PEI, AND Y. YIN, Mining frequent patterns without candidate generation, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 2000, pp. 1-12.
13. IBM QUEST RESEARCH GROUP, http://www.almaden.ibm.com/software/quest/ Resources/datasets/syndata.html#assocSynData
14. L. V. S. LAKSHMANAN. R. T. NG, J. HAN, AND A. PANG, Optimization of constraint frequent set queries with 2-variable constraints, in Proceedings of the ACM SIGMOD International Conference of Management of Data. 1999, pp. 157-168.
15. M. KARR, Summations infinite terms, J. ACM, 28 (1981), pp. 305-350.
16. H. MANNILA, Methods and problems in data mining, in Proceedings of the International Conference on Database Theory, Springer-Verlag, New York, 1997, pp. 41-55.
17. H. MANNILA, H. TOIVONEN, AND A. I. VERKAMO, Efficient algorithms for discovering association rules, in Proceedings of the AAAI Workshop on Knowledge Discovery in Databases. 1994, pp. 181-192.
18. R. T. NG, L. V. S. LAKSHMANAN, J. HAN. AND A. PANG, Exploratory mining and pruning optimizations of constrained association rules, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 1998, pp. 13-24.
19. P. W. PURDOM, JR., AND C. A. BROWN, The Analysis of Algorithms, Holt, Rinehart and Winston, New York, 1985.
20. S. SARAWAGI, S. THOMAS, AND R. AGRAWAL, Integrating association rule mining with relational database systems: Alternatives and implications, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 1998. pp. 343-354.
21. H. TOIVONEN, Discovery of Frequent Patterns in Large Data Collections. Ph.D. Thesis, Report A-1996-5. University of Helsinki, 1996.
22. S. TSUR, J. D. ULLMAN, S. ABITEBOUL, C. CLIFTON, R. MOTWANI, S. NESTOHOV, AND A. ROSENTHAL, Query flocks: A generalization of association-rule mining, in Proceedings of the ACM SIGMOD International Conference of Management of Data, 1998, pp. 1-12.
23. http://dataferrett.census.gov/TheDataWeb/index.html
24. Z. ZHENG. R. KOHAVI, AND L. MASON, Real world performance of association rule algorithms, in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, pp. 401-406.