Sciweavers

334 search results - page 40 / 67
» The Alternating Decision Tree Learning Algorithm
Sort
View
NAACL
2010
14 years 7 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
DIS
2006
Springer
15 years 1 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
15 years 1 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
CANDC
2005
ACM
14 years 9 months ago
Gene selection from microarray data for cancer classification - a machine learning approach
A DNA microarray can track the expression levels of thousands of genes simultaneously. Previous research has demonstrated that this technology can be useful in the classification ...
Yu Wang 0008, Igor V. Tetko, Mark A. Hall, Eibe Fr...
87
Voted
JMLR
2010
107views more  JMLR 2010»
14 years 4 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper