Sciweavers

957 search results - page 6 / 192
» A Probability Model for Combining Ranks
Sort
View
ECSQARU
2009
Springer
15 years 4 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
EWCBR
2008
Springer
14 years 11 months ago
Instance-Based Label Ranking using the Mallows Model
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
Weiwei Cheng, Eyke Hüllermeier
DELOS
2000
14 years 11 months ago
Applications of Quick-Combine for Ranked Query Models
Wolf-Tilo Balke, Werner Kießling, Ulrich G&u...
ECIR
2011
Springer
14 years 1 months ago
Learning Models for Ranking Aggregates
Aggregate ranking tasks are those where documents are not the final ranking outcome, but instead an intermediary component. For instance, in expert search, a ranking of candidate ...
Craig Macdonald, Iadh Ounis
ECIR
2009
Springer
15 years 6 months ago
Joint Ranking for Multilingual Web Search
Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s langu...
Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong