Sciweavers

17 search results - page 1 / 4
» Adaptive and Resource-Aware Mining of Frequent Sets
Sort
View
ICDM
2002
IEEE
99views Data Mining» more  ICDM 2002»
13 years 9 months ago
Adaptive and Resource-Aware Mining of Frequent Sets
Salvatore Orlando, Paolo Palmerini, Raffaele Pereg...
FIMI
2003
170views Data Mining» more  FIMI 2003»
13 years 6 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
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...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
13 years 11 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 4 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
FIMI
2003
136views Data Mining» more  FIMI 2003»
13 years 6 months ago
Intersecting data to closed sets with constraints
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...
Taneli Mielikäinen