162 search results - page 2 / 33 » Parallel frequent set counting |
FIMI
2003
13 years 6 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...
ADC
2003
Springer
13 years 10 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
DAWAK
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
DMIN
2007
13 years 6 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...