Sciweavers

62 search results - page 5 / 13
» Cost-Sensitive Learning of SVM for Ranking
Sort
View
AAAI
2008
13 years 8 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 5 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
ECIR
2010
Springer
13 years 7 months ago
Learning to Select a Ranking Function
Abstract. Learning To Rank (LTR) techniques aim to learn an effective document ranking function by combining several document features. While the function learned may be uniformly ...
Jie Peng, Craig Macdonald, Iadh Ounis
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 6 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
13 years 5 months ago
Direct Optimization of Evaluation Measures in Learning to Rank Using Particle Swarm
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
Ósscar Alejo, Juan M. Fernández-Luna...