Sciweavers

507 search results - page 31 / 102
» Portfolio theory of information retrieval
Sort
View
64
Voted
SIGIR
2008
ACM
14 years 9 months ago
Parsimonious relevance models
We describe a method for applying parsimonious language models to re-estimate the term probabilities assigned by relevance models. We apply our method to six topic sets from test ...
Edgar Meij, Wouter Weerkamp, Krisztian Balog, Maar...
SIGIR
2006
ACM
15 years 3 months ago
Adapting ranking SVM to document retrieval
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
Yunbo Cao, Jun Xu, Tie-Yan Liu, Hang Li, Yalou Hua...
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 3 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
IIR
2010
14 years 11 months ago
Developing the Quantum Probability Ranking Principle
In this work, we summarise the development of a ranking principle based on quantum probability theory, called the Quantum Probability Ranking Principle (QPRP), and we also provide...
Guido Zuccon, Leif Azzopardi
RECSYS
2009
ACM
15 years 4 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina