1209 search results - page 95 / 242 » Semi-Supervised Learning with Trees |
133
Voted
ICANNGA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
150
click to vote
ICGI
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
123
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
127
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
125
Voted
COLT
1992
Springer
15 years 7 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...