Sciweavers

385 search results - page 25 / 77
» Probabilistic ranking over relations
Sort
View
SIGIR
2006
ACM
14 years 1 months 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
WEBI
2007
Springer
14 years 1 months ago
Concordance-Based Entity-Oriented Search
— We consider the problem of finding the relevant named entities in response to a search query over a given text corpus. Entity search can readily be used to augment conventiona...
Mikhail Bautin, Steven Skiena
RSKT
2010
Springer
13 years 6 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
ICDE
2008
IEEE
425views Database» more  ICDE 2008»
15 years 7 months ago
NAGA: Searching and Ranking Knowledge
The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracte...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
13 years 11 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala