Sciweavers

1923 search results - page 194 / 385
» Weighted Decision Trees
Sort
View
ML
2000
ACM
185views Machine Learning» more  ML 2000»
15 years 6 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
ESOP
2000
Springer
15 years 10 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 6 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein

Publication
404views
16 years 3 months ago
Bayesian variable order Markov models.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree wei...
Christos Dimitrakakis
AAAI
2010
15 years 8 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...