Sciweavers

2018 search results - page 92 / 404
» Magnitude-preserving ranking algorithms
Sort
View
SIGIR
2006
ACM
16 years 3 days ago
Improving web search ranking by incorporating user behavior information
We show that incorporating user behavior data can significantly improve ordering of top results in real web search setting. We examine alternatives for incorporating feedback into...
Eugene Agichtein, Eric Brill, Susan T. Dumais
SIGIR
2012
ACM
13 years 8 months ago
Robust ranking models via risk-sensitive optimization
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
Lidan Wang, Paul N. Bennett, Kevyn Collins-Thompso...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 6 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
FOCS
2008
IEEE
15 years 6 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
SOCINFO
2010
15 years 4 months ago
Dynamic Context-Sensitive PageRank for Expertise Mining
Abstract. Online tools for collaboration and social platforms have become omnipresent in Web-based environments. Interests and skills of people evolve over time depending in perfor...
Daniel Schall, Schahram Dustdar