2040 search results - page 179 / 408 » On the Complexity of Error Explanation |
133
click to vote
MCS
2000
Springer
15 years 8 months ago
2000
Springer
Various methods exist for reducing correlation between classifiers in a multiple classifier framework. The expectation is that the composite classifier will exhibit improved perfor...
120
click to vote
WSC
2007
15 years 6 months ago
2007
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
101
click to vote
NIPS
2003
15 years 5 months ago
2003
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
141
click to vote
IJCAI
1989
15 years 5 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
140
click to vote
JC
2007
15 years 4 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...