74 search results - page 1 / 15 » The complexity of mining maximal frequent itemsets and maxim... |
KDD
2004
ACM
14 years 5 months ago
2004
ACM
ICTAI
2003
IEEE
13 years 10 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...
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...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
FIMI
2003
13 years 6 months ago
2003
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...