Most traditional Information Retrieval (IR) systems, including web search engines, operationalize “relevant” as the word frequency in a document of a set of keywords. Because ...
Hyun Woong Shin, Eduard H. Hovy, Dennis McLeod, La...
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...
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...
Wisam Dakka, Luis Gravano, Panagiotis G. Ipeirotis
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...