Sciweavers

1768 search results - page 49 / 354
» Mining Very Large Databases
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 10 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 2 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
WWW
2008
ACM
14 years 10 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
DATAMINE
2006
142views more  DATAMINE 2006»
13 years 10 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
BMVC
1998
13 years 11 months ago
Choosing an Optimal Neural Network Size to aid a Search Through a Large Image Database
In this paper a fast method of selecting a neural network architecture for pattern recognition tasks is presented. We demonstrate that our proposed method of selecting both input ...
Kieron Messer, Josef Kittler