Sciweavers

3395 search results - page 32 / 679
» Learning to efficiently rank
Sort
View
FUIN
2006
139views more  FUIN 2006»
13 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
ECIR
2006
Springer
13 years 9 months ago
Efficient Parallel Computation of PageRank
Abstract. PageRank inherently is massively parallelizable and distributable, as a result of web's strict host-based link locality. In this paper we show that the Gau
Christian Kohlschütter, Paul-Alexandru Chirit...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 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
ECML
2003
Springer
14 years 27 days ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
NAACL
2010
13 years 5 months ago
Constraint-Driven Rank-Based Learning for Information Extraction
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
Sameer Singh, Limin Yao, Sebastian Riedel, Andrew ...