174 search results - page 4 / 35 » Probabilistic frequent itemset mining in uncertain databases |
AMT
2006
Springer
13 years 8 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
FIMI
2003
13 years 7 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
APWEB
2005
Springer
13 years 11 months ago
2005
Springer
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
ICDM
2005
IEEE
13 years 12 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...