43 search results - page 4 / 9 » Fast Frequent Itemset Mining using Compressed Data Represent... |
ADBIS
1998
Springer
14 years 1 months ago
1998
Springer
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
IDA
2002
Springer
13 years 8 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
KDD
1997
ACM
14 years 18 days ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
CORR
2011
Springer
13 years 18 days ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
CINQ
2004
Springer
14 years 2 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...