388 search results - page 31 / 78 » Mining Frequent Itemsets Using Support Constraints |
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
FIMI
2004
15 years 1 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...
KDD
2001
ACM
16 years 5 days ago
2001
ACM
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improve...
105
click to vote
FIMI
2003
15 years 1 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
109
click to vote
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...