11 search results - page 2 / 3 » fimi 2004 |
FIMI
2004
13 years 6 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
FIMI
2004
13 years 6 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...
FIMI
2004
13 years 6 months ago
2004
Nowadays basic algorithms such as Apriori and Eclat often are conceived as mere textbook examples without much practical applicability: in practice more sophisticated algorithms w...
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...
FIMI
2004
13 years 6 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 ...