Sciweavers

378 search results - page 52 / 76
» Learning to Rank with Supplementary Data
Sort
View
SIGIR
2010
ACM
13 years 11 months ago
Learning more powerful test statistics for click-based retrieval evaluation
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
Yisong Yue, Yue Gao, Olivier Chapelle, Ya Zhang, T...
ICIP
2005
IEEE
14 years 9 months ago
Feature selection with nonparametric statistics
In this paper we discuss a general framework for feature selection based on nonparametric statistics. The three stage approach we propose is based on the assumption that the avail...
Emanuele Franceschi, Francesca Odone, Fabrizio Sme...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
PKDD
2010
Springer
212views Data Mining» more  PKDD 2010»
13 years 6 months ago
Cross Validation Framework to Choose amongst Models and Datasets for Transfer Learning
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
ErHeng Zhong, Wei Fan, Qiang Yang, Olivier Versche...
PROMISE
2010
13 years 2 months ago
On the value of learning from defect dense components for software defect prediction
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
Hongyu Zhang, Adam Nelson, Tim Menzies