388 search results - page 13 / 78 » Mining Frequent Itemsets Using Support Constraints |
FIMI
2003
13 years 8 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...
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
Recently there is much need of discovering useful knowledge from massive log-data which are generated by Webbased information systems. Such log-data have multiple attributes about...
ICDM
2002
IEEE
14 years 13 days ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
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...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
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...