Sciweavers

64 search results - page 4 / 13
» On the Boosting Ability of Top-Down Decision Tree Learning A...
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 3 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
IJCAI
1993
13 years 9 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
ICMLA
2010
13 years 5 months ago
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
Jean Baptiste Faddoul, Boris Chidlovskii, Fabien T...
CORR
2000
Springer
132views Education» more  CORR 2000»
13 years 7 months ago
A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation
This paper describes a set of comparative experiments, including cross{corpus evaluation, between ve alternative algorithms for supervised Word Sense Disambiguation (WSD), namely ...
Gerard Escudero, Lluís Màrquez, Germ...