Sciweavers

44 search results - page 1 / 9
» A probability analysis for candidate-based frequent itemset ...
Sort
View
SAC
2006
ACM
13 years 10 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
14 years 4 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
11 years 6 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
ISCI
2008
116views more  ISCI 2008»
13 years 4 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
13 years 10 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...