Sciweavers

1283 search results - page 71 / 257
» Learning Voting Trees
Sort
View
ACL
1997
13 years 9 months ago
Mistake-Driven Mixture of Hierarchical Tag Context Trees
This paper proposes a mistake-driven mixture method for learning a tag model. The method iteratively performs two proce
Masahiko Haruno, Yuji Matsumoto
ATAL
2009
Springer
14 years 2 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
ICML
2008
IEEE
14 years 8 months ago
An empirical evaluation of supervised learning in high dimensions
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
Rich Caruana, Nikolaos Karampatziakis, Ainur Yesse...
ICML
2006
IEEE
14 years 8 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...