Sciweavers

3395 search results - page 76 / 679
» Learning to efficiently rank
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 9 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
IJON
2006
189views more  IJON 2006»
13 years 9 months ago
Storing and restoring visual input with collaborative rank coding and associative memory
Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing s...
Martin Rehn, Friedrich T. Sommer
WWW
2009
ACM
14 years 9 months ago
A dynamic bayesian network click model for web search ranking
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
Olivier Chapelle, Ya Zhang
RECSYS
2009
ACM
14 years 3 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
Benjamin M. Marlin, Richard S. Zemel
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 10 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li