Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7523 LNAI, Issue PART 1, 2012, Pages 25-41

  Riondato, Matteo ^a   Upfal, Eli ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; ARTIFICIAL DATASETS; DATA SETS; DATABASE APPLICATIONS; EXACT ALGORITHMS; EXPERIMENTAL EVALUATION; HIGH QUALITY; ITEM SETS; NOVEL TECHNIQUES; OVER SAMPLING; PERFORMANCE GUARANTEES; RANGE SPACES; RUNNING TIME; SAMPLE SIZES; STATISTICAL CONCEPTS; TIGHT BOUND; VAPNIK-CHERVONENKIS DIMENSIONS; VC-DIMENSION;

ASSOCIATION RULES; DATABASE SYSTEMS; LEARNING SYSTEMS;

QUALITY CONTROL;

EID: 84866866005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33460-3_7     Document Type: Conference Paper

References (41)

1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD Rec. 22, 207-216 (1993)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994 (1994)
3. Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley (2008)
4. Brönnimann, H., Chen, B., Dash, M., Haas, P., Scheuermann, P.: Efficient data reduction with ease. In: KDD 2003 (2003)
5. Ceglar, A., Roddick, J.F.: Association mining. ACM Comput. Surv. 38(5) (2006)
6. Chakaravarthy, V.T., Pandit, V., Sabharwal, Y.: Analysis of sampling techniques for association rule mining. In: ICDT 2009 (2009)
7. Chandra, B., Bhaskar, S.: A new approach for generating efficient sample from market basket data. Expert Sys. with Appl. 38(3), 1321-1325 (2011)
8. Chazelle, B.: The discrepancy method: randomness and complexity, Cambridge (2000)
9. Chen, B., Haas, P., Scheuermann, P.: A new two-phase sampling based algorithm for discovering association rules. In: KDD 2002 (2002)
10. Chen, C., Horng, S.-J., Huang, C.-P.: Locality sensitive hashing for sampling-based algorithms in association rule mining. Expert Sys. with Appl. 38(10), 12388-12397 (2011)
11. Cheung, Y.-L., Fu, A.W.-C.: Mining frequent itemsets without support threshold: With and without item constraints. IEEE Trans. on Knowl. and Data Eng. 16, 1052-1069 (2004)
12. Chuang, K.-T., Chen, M.-S., Yang, W.-C.: Progressive Sampling for Association Rules Based on Sampling Error Estimation. In: Adv. in Knowl. Disc. and Data Mining. Springer, Heidelberg (2005)
13. Chuang, K.-T., Huang, J.-L., Chen, M.-S.: Power-law relationship and self-similarity in the itemset support distribution: analysis and applications. The VLDB Journal 17(5) (2008)
14. Fu, A.W.-C., Kwong, R.W.-W., Tang, J.: Mining N-most Interesting Itemsets. In: Ohsuga, S., Raś, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 59-67. Springer, Heidelberg (2000)
15. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15, 55-86 (2007)
16. Har-Peled, S., Sharir, M.: Relative (p, ε)-approximations in geometry. Discr. & Comput. Geometry 45(3), 462-496 (2011)
17. Hu, X., Yu, H.: The Research of Sampling for Mining Frequent Itemsets. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 496-501. Springer, Heidelberg (2006)
18. Hwang, W., Kim, D.: Improved association rule mining by modified trimming. In: CIT 2006 (2006)
19. Jia, C., Lu, R.: Sampling Ensembles for Frequent Patterns. In: Wang, L., Jin, Y. (eds.) FSKD 2005. LNCS (LNAI), vol. 3613, pp. 1197-1206. Springer, Heidelberg (2005)
20. Jia, C.-Y., Gao, X.-P.: Multi-scaling sampling: An adaptive sampling method for discovering approximate association rules. J. of Comp. Sci. and Tech. 20, 309-318 (2005)
21. John, G.H., Langley, P.: Static versus dynamic sampling for data mining. In: KDD 1996 (1996)
22. Li, Y., Gopalan, R.: Effective Sampling for Mining Association Rules. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 391-401. Springer, Heidelberg (2004)
23. Linial, N., Mansour, Y., Rivest, R.L.: Results on learnability and the Vapnik-Chervonenkis dimension. Information and Computation 1, 33-49 (1991)
24. Löffler, M., Phillips, J.M.: Shape Fitting on Point Sets with Probability Distributions. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 313-324. Springer, Heidelberg (2009)
25. Mahafzah, B.A., Al-Badarneh, A.F., Zakaria, M.Z.: A new sampling technique for association rule mining. J. of Information Science 3, 358-376 (2009)
26. Mampaey, M., Tatti, N., Vreeken, J.: Tell me what i need to know: succinctly summarizing data with itemsets. In: KDD 2011 (2011)
27. Mannila, H., Toivonen, H., Verkamo, I.: Efficient algorithms for discovering association rules. In: KDD 1994 (1994)
28. Parthasarathy, S.: Efficient progressive sampling for association rules. In: ICDM 2002 (2002)
29. Pietracaprina, A., Riondato, M., Upfal, E., Vandin, F.: Mining top-K frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21, 310-326 (2010)
30. Pietracaprina, A., Vandin, F.: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 275-280. Springer, Heidelberg (2007)
31. Riondato, M., Upfal, E.: Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees. CoRR abs/1111.6937 (2011)
32. Scheffer, T., Wrobel, S.: Finding the most interesting patterns in a database quickly by using sequential sampling. J. Mach. Learn. Res. 3, 833-862 (2002)
33. Toivonen, H.: Sampling large databases for association rules. In: VLDB 1996 (1996)
34. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer-Verlag (1999)
35. Vapnik, V.N., Chervonenkis, A.J.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its Appl. 16(2), 264-280 (1971)
36. Vasudevan, D., Vojonović, M.: Ranking through random sampling. MSR-TR-2009-8 8, Microsoft Research (2009)
37. Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. on Knowl. and Data Eng. 17, 652-664 (2005)
38. Wang, S., Dash, M., Chia, L.-T.: Efficient Sampling: Application to Image Data. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 452-463. Springer, Heidelberg (2005)
39. Zaki, M., Parthasarathy, S., Li, W., Ogihara, M.: Evaluation of sampling for data mining of association rules. In: RIDE 1997 (1997)
40. Zhang, C., Zhang, S., Webb, G.I.: Identifying approximate itemsets of interest in large databases. Applied Intelligence 18, 91-104 (2003)
41. Zhao, Y., Zhang, C., Zhang, S.: Efficient frequent itemsets mining by sampling. In: AMT 2006 (2006)