125
click to vote
FIMI
14 years 10 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 ...
FIMI
14 years 10 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 ...
FIMI
14 years 10 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...
FIMI
14 years 10 months ago
2004  FIMI
14 years 10 months ago
2004 
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
|
Data Mining