Sciweavers

1605 search results - page 87 / 321
» Metric Learning to Rank
Sort
View
CIKM
2008
Springer
14 years 16 hour ago
Suppressing outliers in pairwise preference ranking
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...
Vitor R. Carvalho, Jonathan L. Elsas, William W. C...
COLT
2008
Springer
13 years 11 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
CIKM
2009
Springer
14 years 4 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
TNN
2010
127views Management» more  TNN 2010»
13 years 4 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
ICMCS
2007
IEEE
214views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Exploring Discriminative Learning for Text-Independent Speaker Recognition
Speaker verification is a technology of verifying the claimed identity of a speaker based on the speech signal from the speaker (voice print). To learn the score of similarity be...
Ming Liu, Zhengyou Zhang, Mark Hasegawa-Johnson, T...