Sciweavers

3652 search results - page 147 / 731
» A study of query length
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Query expansion using term relationships in language models for information retrieval
Language Modeling (LM) has been successfully applied to Information Retrieval (IR). However, most of the existing LM approaches only rely on term occurrences in documents, queries...
Jing Bai, Dawei Song, Peter Bruza, Jian-Yun Nie, G...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 8 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
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 8 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
COLT
1999
Springer
14 years 10 days ago
Learning Threshold Functions with Small Weights Using Membership Queries
We study the learnability of Threshold functions with bounded weights using membership queries only. We show that the class Ct of Threshold functions with positive integer weights...
Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar ...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 7 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...