Sciweavers

194 search results - page 27 / 39
» Learning to rank query reformulations
Sort
View
172
Voted
VLSISP
2010
254views more  VLSISP 2010»
15 years 4 days ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
SIGIR
2008
ACM
15 years 1 months ago
A study of learning a merge model for multilingual information retrieval
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
Ming-Feng Tsai, Yu-Ting Wang, Hsin-Hsi Chen
ECIR
2009
Springer
15 years 11 months ago
Combination of Documents Features Based on Simulated Click-through Data
Many different ranking algorithms based on content and context have been used in web search engines to find pages based on a user query. Furthermore, to achieve better performance ...
Ali Mohammad Zareh Bidoki, James A. Thom
ICCV
2007
IEEE
15 years 8 months ago
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
Ondrej Chum, James Philbin, Josef Sivic, Michael I...
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 6 days ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen