98 search results - page 1 / 20 » Parallel Mining of Maximal Frequent Itemsets from Databases |
ICTAI
2003
IEEE
13 years 9 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...
CCGRID
2004
IEEE
13 years 8 months ago
2004
IEEE
FIMI
2004
13 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
SBACPAD
2003
IEEE
13 years 9 months ago
2003
IEEE
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...
ICDE
2001
IEEE
14 years 5 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...