Real world performance of association rule algorithms

By Zijian Zheng, Ron Kohavi, Llew Mason. Knowledge Discovery and Data Mining, 2001

540 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/f5c7c86a66f8594c06dd2c6415b67219abcdfc66

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets (2004, unknown): “これらの問題に対しては,非常に多くのアルゴリズムが提案されている [1, 2, 3, 8, 9, 14, 18, 17, 20, 21].”
Privacy-preserving anonymization of set-valued data (2008, methodology): “To have a realistic setting for our experimental evaluation, we used three real word-datasets introduced in [24]: BMS-POS , BMS-WebView-1 and BMS-WebView-2 .”
Moment: maintaining closed frequent itemsets over a stream sliding window (2004, methodology): “This dataset was used in KDDCUP 2000 [18].”
CALM: Consistent Adaptive Local Marginal for Marginal Release under Local Differential Privacy (2018, background): “Figure 4 illustrates the results for comparing CALM against existing methods we discussed in Section 3 on two binary datasets Kosarak and POS.”
EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT (2003, methodology): “The data sets I used are: BMS-Webview-1 (a web click stream from a leg-care company that no longer exists, which has been used in the KDD cup 2000 [7, 9]), T10I4D100K (an artificial data set generated with IBM’s data generator [10]), census (a data set derived from an extract of the US census bureau”
Survey on Frequent Pattern Mining (2003, background): “in their article on the real world performance of association rule algorithms [45] in which five well-known association rule mining algorithms are compared on three new real-world data sets.”
Mining All Non-derivable Frequent Itemsets (2002, methodology): “The second dataset was the BMS-Webview-1 dataset donated by Z. Zheng et al. [16], containing 59 602 transactions over 497 items.”
Induction of Association Rules: Apriori Implementation (2002, methodology): “We used two datasets: The BMS-webview-1 dataset, which was also used as a benchmark by Zheng et al. (2001) and which is derived from the KDD-Cup 2001 data [Kohavi et al. (2000)].”
Maintaining Data Privacy in Association Rule Mining (2002, methodology): “A real dataset, BMS-WebView-1 [20], placed in the public domain by Blue Martini Software.”
CLOSET+: searching for the best strategies for mining frequent closed itemsets (2003, methodology): “have been used in the previous performance studies [18, 19].”