Sciweavers

8301 search results - page 1399 / 1661
» Risk-Aware Information Retrieval
Sort
View
WWW
2002
ACM
16 years 7 months ago
Probabilistic question answering on the web
Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that...
Dragomir R. Radev, Weiguo Fan, Hong Qi, Harris Wu,...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 7 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 7 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
« Prev « First page 1399 / 1661 Last » Next »