Sciweavers

1016 search results - page 2 / 204
» Generalized distances between rankings
Sort
View
WWW
2010
ACM
13 years 12 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
IPM
2008
133views more  IPM 2008»
13 years 5 months ago
DistanceRank: An intelligent ranking algorithm for web pages
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
Ali Mohammad Zareh Bidoki, Nasser Yazdani
CIKM
2009
Springer
13 years 9 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
COLING
2008
13 years 6 months ago
Rank Distance as a Stylistic Similarity
In this paper we propose a new distance function (rank distance) designed to reflect stylistic similarity between texts. To assess the ability of this distance measure to capture ...
Marius Popescu, Liviu Petrisor Dinu