Sciweavers

2988 search results - page 26 / 598
» Experiments with a New Boosting Algorithm
Sort
View
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
ICANN
2003
Springer
15 years 2 months ago
A Comparison of Model Aggregation Methods for Regression
Combining machine learning models is a means of improving overall accuracy.Various algorithms have been proposed to create aggregate models from other models, and two popular examp...
Zafer Barutçuoglu
PR
2008
85views more  PR 2008»
14 years 9 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
ICVS
2009
Springer
14 years 7 months ago
Boosting with a Joint Feature Pool from Different Sensors
This paper introduces a new way to apply boosting to a joint feature pool from different sensors, namely 3D range data and color vision. The combination of sensors strengthens the ...
Dominik Alexander Klein, Dirk Schulz, Simone Frint...
81
Voted
IJCAI
2003
14 years 11 months ago
Monte Carlo Theory as an Explanation of Bagging and Boosting
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
Roberto Esposito, Lorenza Saitta