173
Voted
FIMI
15 years 2 months ago
2004 
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
116
Voted
FIMI
15 years 2 months ago
2004 
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
110
Voted
FIMI
15 years 2 months ago
2004 
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
107
Voted
FIMI
15 years 2 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...
101
click to vote
FIMI
15 years 2 months ago
2004 
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
|
Data Mining