205 search results - page 6 / 41 » Decision trees do not generalize to new variations |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
— Most research in machine learning focuses on scenarios in which a learner faces a single learning task, independently of other learning tasks or prior knowledge. In reality, ho...
IFSA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Generally, there are two main streams of theories for studying uncertainties. One is probability theory and the other is fuzzy set theory. One of the basic ideas of fuzzy...
SIGIR
2005
ACM
14 years 2 months ago
2005
ACM
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
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...