Sciweavers

782 search results - page 56 / 157
» A measure theoretic approach to information retrieval
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CIKM
2009
Springer
16 years 23 days ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber
SIGIR
2009
ACM
16 years 21 days ago
Topic (query) selection for IR evaluation
The need for evaluating large amounts of topics (queries) makes IR evaluation an uneasy task. In this paper, we study a topic selection problem for IR evaluation. The selection cr...
Jianhan Zhu, Jun Wang, Vishwa Vinay, Ingemar J. Co...
MM
2006
ACM
203views Multimedia» more  MM 2006»
16 years 4 days ago
Learning image manifolds by semantic subspace projection
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
Jie Yu, Qi Tian
CIKM
2008
Springer
15 years 8 months ago
Probabilistic polyadic factorization and its application to personalized recommendation
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
Yun Chi, Shenghuo Zhu, Yihong Gong, Yi Zhang