Sciweavers

2100 search results - page 35 / 420
» Learning to rank on graphs
Sort
View
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
14 years 10 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...
AIRS
2010
Springer
14 years 7 months ago
Learning to Rank with Supplementary Data
This paper is concerned with a new task of ranking, referred to as "supplementary data assisted ranking", or "supplementary ranking" for short. Different from c...
Wenkui Ding, Tao Qin, Xu-Dong Zhang
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
ICML
2010
IEEE
14 years 10 months ago
Label Ranking under Ambiguous Supervision for Learning Semantic Correspondences
This paper studies the problem of learning from ambiguous supervision, focusing on the task of learning semantic correspondences. A learning problem is said to be ambiguously supe...
Antoine Bordes, Nicolas Usunier, Jason Weston
WWW
2010
ACM
15 years 4 months ago
RankCompete: simultaneous ranking and clustering of web photos
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
Liangliang Cao, Andrey Del Pozo, Xin Jin, Jiebo Lu...