Sciweavers

2018 search results - page 135 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Ranking related entities: components and analyses
Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given sour...
Marc Bron, Krisztian Balog, Maarten de Rijke
CIKM
2010
Springer
15 years 4 months ago
Manifold ranking with sink points for update summarization
Update summarization aims to create a summary over a topic-related multi-document dataset based on the assumption that the user has already read a set of earlier documents of the ...
Pan Du, Jiafeng Guo, Jin Zhang, Xueqi Cheng
WWW
2010
ACM
16 years 1 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
EPEW
2005
Springer
15 years 12 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
14 years 1 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...