Robust and distributed top-N frequent-pattern mining with SAP BW accelerator

Proceedings of the VLDB Endowment

Volumn 2, Issue 2, 2009, Pages 1438-1449

  Legler, Thomas ^a   Lehner, Wolfgang ^b   Schaffner, Jan ^c   Krüger, Jens ^c  

^a SAP RESEARCH   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; SEMANTICS; SHAPE MEMORY EFFECT;

DATA CHARACTERISTICS; DATABASE ARCHITECTURE; FREQUENT PATTERN MINING; HEURISTIC SEARCH STRATEGY; PERFORMANCE BOTTLENECKS; REAL DISTRIBUTION; REAL-WORLD DATASETS; REAL-WORLD SCENARIO;

DATA MINING;

EID: 79952579920     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687553.1687571     Document Type: Article

References (26)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules.
2. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proc. of the 20th Intl. Conf. On Very Large Data Bases, pages 487-499. Morgan Kaufmann, 1994.
3. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-260, 1999.
4. P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In Proc. of Intl. Symposium on Principles Of Distributed Computing, pages 206-215, 2004.
5. J. Chattratichat, J. Darlington, Y. Guo, S. Hedvall, M. Köler, and J. Syed. An architecture for distributed enterprise data mining. In Proc. of the 7th Intl. Conf. On High-Performance Computing And Networking, pages 573-582, 1999.
6. D. W.-L. Cheung and Y. Xiao. Effect of data skewness in parallel mining of association rules. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 48-60, 1998.
7. K.-T. Chuang, J.-L. Huang, and M.-S. Chen. Mining top-k frequent patterns in the presence of the memory constraint. The VLDB Journal, 17(5):1321-1344, 2008.
8. S. Cong. Mining the top-k frequent itemset with minimum length m, 2001.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of the 19th Intl. Conf. on Management of Data, pages 1-12, 2000.
10. J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In Proc. of the ICDM'02, December 2002.
11. Z. He. Mining top-k approximate frequent patterns. Technical Report TR-2005-0315, 2005.
12. The IlliMine Project, http://illimine.cs.uiuc.edu.
13. A. H. Land and A. G. Doig. An automatic method of solving discrete programming problems. Econometrica, 28:497-520, 1960.
14. T. Legler, W. Lehner, and A. Ross. Data mining with the SAP NetWeaver BI accelerator. In Proc. of the 32nd Intl. Conf. On Very Large Data Bases, pages 1059-1068, 2006.
15. S. Michel, P. Triantafillou, and G. Weikum. KLEE: a framework for distributed top-k query algorithms. In Proc. of the 31st Intl. Conf. On Very Large Data Bases, pages 637-648. VLDB Endowment, 2005.
16. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.
17. A. Ross. SAP NetWeaver BI Accelerator. Galileo Press, 2009.
18. A. Savasere, E. Omiecinski, and S. B. Navathe. An efficient algorithm for mining association rules in large databases. In The VLDB Journal, pages 432-444, 1995.
19. D. B. Skillicorn. Parallel frequent set counting. Parallel Computing, 28(5):815-825, 2002.
20. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In Proc. of the 2004 Intl. Conf. on Very Large Data Bases, pages 648-659, August 2004.
21. R. Wirth, M. Borth, and J. Hipp. When distribution is part of the semantics: A new problem class for distributed knowledge discovery. In Proc. of the PKDD 2001 Workshop on Ubiquitous Data Mining for Mobile and Distributed Environments, pages 56-64, Freiburg, Germany, 2001.
22. M. Zaki. Parallel and distributed association mining: A survey. IEEE Concurrency, 7(4):14-25, 1999.
23. M. Zaki and K. Gouda. Fast vertical mining using diffsets. In Proc. of the 2003 Intl. Conf. on Knowledge Discovery and Data Mining, pages 326-335, 2003.
24. M. Zaki and C. Hsiao. Charm: an efficient algorithm for closed association rule mining. Technical report, 1999.
25. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. Technical Report TR651, 1997.
26. Y. Zhao, H. Zhang, F. Figueiredo, L. Cao, and C. Zhang. Mining for combined association rules on multiple datasets. In Proc. of the 2007 Intl. Workshop On Domain Driven Data Mining, pages 18-23, 2007.