4124 search results - page 266 / 825 » Improved Algorithms for Data Migration |
158
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
153
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we present a new co-training strategy that makes use of unlabelled data. It trains two predictors in parallel, with each predictor labelling the unlabelled data for...
149
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
149
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
150
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...