Sciweavers

440 search results - page 20 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
CIKM
2009
Springer
14 years 16 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
EMNLP
2009
13 years 5 months ago
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
Jianfeng Gao, Qiang Wu, Chris Burges, Krysta Marie...
ICML
2010
IEEE
13 years 9 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
KDD
1999
ACM
104views Data Mining» more  KDD 1999»
14 years 5 days ago
Learning Rules from Distributed Data
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...
Lawrence O. Hall, Nitesh V. Chawla, Kevin W. Bowye...
ICML
2001
IEEE
14 years 8 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor