573 search results - page 3 / 115 » Mining Frequent Itemsets from Uncertain Data |
ICTAI
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
APPINF
2003
13 years 7 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
DMIN
2007
13 years 7 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
DAWAK
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...