Robust Distributed Top-N Frequent Pattern Mining Using the SAP BW Accelerator
暂无分享,去创建一个
Wolfgang Lehner | Jens Krüger | Jan Schaffner | Thomas Legler | J. Krüger | Wolfgang Lehner | J. Schaffner | T. Legler
[1] Ramesh Krishnamurti. MINING THE TOP-K FREQUENT ITEMSET WITH MINIMUM LENGTH M , 2001 .
[2] Zhe Wang,et al. Efficient top-K query calculation in distributed networks , 2004, PODC '04.
[3] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[4] David B. Skillicorn. Parallel frequent set counting , 2002, Parallel Comput..
[5] Ming-Syan Chen,et al. Mining top-k frequent patterns in the presence of the memory constraint , 2008, The VLDB Journal.
[6] Yike Guo,et al. An Architecture for Distributed Enterprise Data Mining , 1999, HPCN Europe.
[7] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[8] Jian Pei,et al. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[9] Jiawei Han,et al. Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[10] Gerhard Weikum,et al. Top-k Query Evaluation with Probabilistic Guarantees , 2004, VLDB.
[11] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[12] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Association Rule Mining , 2007 .
[13] Wolfgang Lehner,et al. Data mining with the SAP NetWeaver BI accelerator , 2006, VLDB.
[14] David Wai-Lok Cheung,et al. Effect of Data Skewness in Parallel Mining of Association Rules , 1998, PAKDD.
[15] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[16] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.
[17] Geert Wets,et al. Using association rules for product assortment decisions: a case study , 1999, KDD '99.
[18] Gerhard Weikum,et al. KLEE: A Framework for Distributed Top-k Query Algorithms , 2005, VLDB.
[19] Rüdiger Wirth,et al. When Distribution is Part of the Semantics: A New Problem Class for Distributed Knowledge Discovery , 2001 .
[20] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[21] Mohammed J. Zaki,et al. Fast vertical mining using diffsets , 2003, KDD '03.
[22] Chengqi Zhang,et al. Mining for combined association rules on multiple datasets , 2007, DDDM '07.
[23] Zengyou He. Mining Top-k Approximate Frequent Patterns , 2005, ArXiv.
[24] Mohammed J. Zaki. Parallel and distributed association mining: a survey , 1999, IEEE Concurr..