Sciweavers

144 search results - page 5 / 29
» Semantics of Ranking Queries for Probabilistic Data and Expe...
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
IADIS
2004
13 years 9 months ago
Relevance feedback using semantic association between indexing terms in large free text corpuses
Relevance feedback has been considered as a means of incorporating learning into information retrieval systems for quite sometime now. This paper discusses the research results of...
Shahzad Khan, Kenan Azam
NAACL
2010
13 years 5 months ago
Learning Dense Models of Query Similarity from User Click Logs
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...
WWW
2010
ACM
14 years 2 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
PVLDB
2010
97views more  PVLDB 2010»
13 years 6 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande