Sciweavers

3395 search results - page 66 / 679
» Learning to efficiently rank
Sort
View
CIKM
2008
Springer
13 years 11 months 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...
WWW
2008
ACM
14 years 9 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
CIKM
2009
Springer
14 years 3 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...
ICASSP
2007
IEEE
14 years 3 months ago
Exploiting Concept Association to Boost Multimedia Semantic Concept Detection
In the paper we study the efficiency of semantic concept association in multimedia semantic concept detection. We present an approach to automatically learn from the corpus the as...
Sheng Gao, Xinglei Zhu, Qibin Sun
EDM
2009
106views Data Mining» more  EDM 2009»
13 years 6 months ago
Consistency of Students' Pace in Online Learning
The purpose of this study is to investigate the consistency of students' behavior regarding their pace of actions over sessions within an online course. Pace in a session is d...
Arnon Hershkovitz, Rafi Nachmias