Sciweavers

957 search results - page 62 / 192
» A Probability Model for Combining Ranks
Sort
View
141
Voted
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 4 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
AAAI
2006
15 years 5 months ago
Multi-Conditional Learning: Generative/Discriminative Training for Clustering and Classification
This paper presents multi-conditional learning (MCL), a training criterion based on a product of multiple conditional likelihoods. When combining the traditional conditional proba...
Andrew McCallum, Chris Pal, Gregory Druck, Xuerui ...
110
Voted
CONTEXT
2007
Springer
15 years 10 months ago
Opinion Nets for Reasoning with Uncertain Context Information
Abstract. Context-aware systems must be able to deal with uncertain context information. We propose a generic context architecture and representation that incorporates the uncertai...
Yves Vanrompay, Yolande Berbers
CIKM
2006
Springer
15 years 7 months ago
A probabilistic relevance propagation model for hypertext retrieval
A major challenge in developing models for hypertext retrieval is to effectively combine content information with the link structure available in hypertext collections. Although s...
Azadeh Shakery, ChengXiang Zhai
140
Voted
TSMC
2008
132views more  TSMC 2008»
15 years 3 months ago
Ensemble Algorithms in Reinforcement Learning
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and fin...
Marco A. Wiering, Hado van Hasselt