127 search results - page 9 / 26 » Learning Monotone Decision Trees in Polynomial Time |
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understa...
IEICET
2008
13 years 8 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
TSD
2000
Springer
14 years 3 days ago
2000
Springer
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...