5 search results - page 1 / 1 » Softening Splits in Decision Trees Using Simulated Annealing |
ICANNGA
2007
Springer
13 years 8 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
CSDA
2008
13 years 4 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
FLAIRS
2008
13 years 7 months ago
2008
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
ICRA
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...