Finding associations and computing similarity via biased pair sampling

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 61-70

  Campagna, Andrea ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Algorithms; Association rules; Data mining; Sampling

Indexed keywords

ASSOCIATION MINING; BIASED SAMPLING; COMPUTATION TIME; EXACT METHODS; ORDER OF MAGNITUDE; REAL DATA SETS; SAMPLING-BASED METHOD; SIMILARITY MEASURE;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING;

COMPUTATIONAL EFFICIENCY;

EID: 77951178834     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.35     Document Type: Conference Paper

References (31)

1. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang, "Finding interesting associations without support pruning," IEEE Trans. Knowl. Data Eng, vol. 13, no. 1, pp. 64-78, 2001.
2. S. Brin, R. Motwani, and C. Silverstein, "Beyond market baskets: Generalizing association rules to correlations," SIGMOD Record (ACM Special Interest Group on Management of Data), vol. 26, no. 2, pp. 265-276, Jun. 1997.
3. C. C. Aggarwal and P. S. Yu, "A new framework for itemset generation," in Proceedings of the ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '98). ACM Press, 1998, pp. 18-24.
4. Y.-K. Lee, W.-Y. Kim, Y. D. Cai, and J. Han, "Comine: Efficient mining of correlated patterns," in Proceedings of the IEEE International Conference on Data Mining (ICDM '03). IEEE Computer Society, 2003, pp. 581-584.
5. E. Omiecinski, "Alternative interest measures for mining associations in databases," IEEE Trans. Knowl. Data Eng, vol. 15, no. 1, pp. 57-69, 2003.
6. J. Han and M. Kamber, Data Mining: Concepts and Techniques, 2nd edition. Morgan Kaufmann, 2006.
7. R. Agrawal, M. Mehta, J. C. Shafer, R. Srikant, A. Arning, and T. Bollinger, "The quest data mining system," in Proceedings of the 2nd International Conference of Knowledge Discovery and Data Mining (KDD '96). AAAI Press, 1996, pp. 244-249.
8. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in International Conference On Very Large Data Bases (VLDB '94). Morgan Kaufmann Publishers, Inc., Sep. 1994, pp. 487-499.
9. FIMI '03, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, ser. CEUR Workshop Proceedings, vol. 90. CEUR-WS.org, 2003.
10. FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, ser. CEUR Workshop Proceedings, vol. 126. CEUR-WS.org, 2004.
11. 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 International Conference on Management of Data (SIGMOD '97), ser. SIGMOD Record (ACM Special Interest Group on Management of Data), vol. 26(2). ACM Press, 1997, pp. 255-264.
12. J. S. Park, M.-S. Chen, and P. S. Yu, "An effective hash-based algorithm for mining association rules," SIGMOD Record (ACM Special Interest Group on Management of Data), vol. 24, no. 2, pp. 175-186, Jun. 1995.
13. A. Savasere, E. Omiecinski, and S. B. Navathe, "An efficient algorithm for mining association rules in large databases," in Proceedings of the 21st International Conference on Very Large Data Bases (VLDB '95). Morgan Kaufmann Publishers, 1995, pp. 432-444.
14. R. R. Amossen and R. Pagh, "Faster join-projects and sparse matrix multiplications," in Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, ser. ACM International Conference Proceeding Series, vol. 361. ACM, 2009, pp. 121-126.
15. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," J. Symb. Comput., vol. 9, no. 3, pp. 251-280, 1990.
16. R. Yuster and U. Zwick, "Fast sparse matrix multiplication," ACM Trans. Algorithms, vol. 1, no. 1, pp. 2-13, 2005.
17. H. Toivonen, "Sampling large databases for association rules," in Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB '96). Morgan Kaufmann Publishers, 1996, pp. 134-145.
18. P. Indyk, R. Motwani, P. Raghavan, and S. Vempala, "Locality- preserving hashing in multidimensional spaces," in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 4-6 May 1997, pp. 618-625.
19. M. S. Charikar, "Similarity estimation techniques from rounding algorithms," in STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM, 2002, pp. 380-388.
20. A. Arasu, V. Ganti, and R. Kaushik, "Efficient exact setsimilarity joins," in VLDB. ACM, 2006, pp. 918-929.
21. S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," in ICDE. IEEE Computer Society, 2006, p. 5.
22. C. Xiao, W.Wang, X. Lin, and H. Shang, "Top-k set similarity joins," in Proceedings of the 25th International Conference on Data Engineering, (ICDE '09). IEEE, 2009, pp. 916-927.
23. C. Xiao, W. Wang, X. Lin, and J. X. Yu, "Efficient similarity joins for near duplicate detection," in Proceedings of the 17th International Conference on World Wide Web, (WWW '08). ACM, 2008, pp. 131-140.
24. A. Aggarwal and J. S. Vitter, "The input/output complexity of sorting and related problems," Comm. ACM, vol. 31, no. 9, pp. 1116-1127, 1988.
25. R. Motwani and P. Raghavan, Randomized algorithms. Cambridge University Press, 1995.
26. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, "Min-wise independent permutations," J. Comput. Syst. Sci., vol. 60, no. 3, pp. 630-659, 2000.
27. P. Indyk, "A small approximately min-wise independent family of hash functions," in Proocedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), 1999, pp. 454-456.
28. A. Z. Broder and M. Mitzenmacher, "Network applications of Bloom filters: A survey," in Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing. ACM Press, 2002, pp. 636-646.
29. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng, "KDD-Cup 2000 organizers' report: Peeling the onion," SIGKDD Explorations, vol. 2, no. 2, pp. 86-98, 2000.
30. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets, "Using association rules for product assortment decisions: A case study," in Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '99). ACM Press, 1999, pp. 254-260.
31. K. Geurts, G. Wets, T. Brijs, and K. Vanhoof, "Profiling high frequency accident locations using association rules," in Proceedings of the 82nd Annual Transportation Research Board, 2003, p. 18pp.