Sciweavers

174 search results - page 5 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
VLDB
2000
ACM
130views Database» more  VLDB 2000»
13 years 11 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
CORR
2004
Springer
146views Education» more  CORR 2004»
13 years 7 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 27 days ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
14 years 28 days ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
DAWAK
2004
Springer
14 years 1 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
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...
Zhung-Xun Liao, Man-Kwan Shan