Sciweavers

2018 search results - page 43 / 404
» Magnitude-preserving ranking algorithms
Sort
View
VLDB
2005
ACM
109views Database» more  VLDB 2005»
15 years 3 months ago
Link Spam Alliances
Link spam is used to increase the ranking of certain target web pages by misleading the connectivity-based ranking algorithms in search engines. In this paper we study how web pag...
Zoltán Gyöngyi, Hector Garcia-Molina
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 10 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 4 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
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