Sciweavers

7215 search results - page 160 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
WWW
2010
ACM
14 years 3 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
TEC
2010
132views more  TEC 2010»
13 years 2 months ago
A Hybrid Evolutionary Approach to the Nurse Rostering Problem
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
Ruibin Bai, Edmund K. Burke, Graham Kendall, Jingp...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 8 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu