1923 search results - page 185 / 385 » Weighted Decision Trees |
156
click to vote
IJCAI
2007
15 years 7 months ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
164
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
139
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
173
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
163
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...