Sciweavers

12863 search results - page 779 / 2573
» Dynamic Data Mining
Sort
View
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 7 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
16 years 7 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
PKDD
2001
Springer
104views Data Mining» more  PKDD 2001»
15 years 12 months ago
Data Reduction Using Multiple Models Integration
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
Aleksandar Lazarevic, Zoran Obradovic
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
15 years 9 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 9 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...