Sciweavers

1683 search results - page 153 / 337
» Learning with Mixtures of Trees
Sort
View
ECCC
2002
74views more  ECCC 2002»
13 years 9 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
COLT
2001
Springer
14 years 2 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
SAC
2010
ACM
14 years 4 months ago
Towards the induction of terminological decision trees
A concept learning framework for terminological representations is introduced. It is grounded on a method for inducing logic decision trees as an adaptation of the classic tree in...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 3 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ISMIS
2000
Springer
14 years 1 months ago
Prediction of Ordinal Classes Using Regression Trees
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
Stefan Kramer, Gerhard Widmer, Bernhard Pfahringer...