Sciweavers

94 search results - page 7 / 19
» Boosting Lazy Decision Trees
Sort
View
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...
ECAI
2006
Springer
13 years 11 months ago
Ensembles of Grafted Trees
Grafted trees are trees that are constructed using two methods. The first method creates an initial tree, while the second method is used to complete the tree. In this work, the fi...
Juan José Rodríguez, Jesús Ma...
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
VLDB
1995
ACM
194views Database» more  VLDB 1995»
13 years 11 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
EMNLP
2004
13 years 9 months ago
A Boosting Algorithm for Classification of Semi-Structured Text
The focus of research in text classification has expanded from simple topic identification to more challenging tasks such as opinion/modality identification. Unfortunately, the la...
Taku Kudo, Yuji Matsumoto