Sciweavers

2 search results - page 1 / 1
» Visualizing differences in web search algorithms using the e...
Sort
View
WWW
2010
ACM
13 years 11 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 2 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen