126
click to vote
FIMI
15 years 2 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...
106
click to vote
FIMI
15 years 2 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
102
click to vote
FIMI
15 years 2 months ago
2003 
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
105
click to vote
FIMI
15 years 2 months ago
2003
In this paper, we first focus our attention on the question of how much space remains for performance improvement over current association rule mining algorithms. Our strategy is...
108
click to vote
FIMI
15 years 2 months ago
2003 
We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...
|
Data Mining