Sciweavers

46 search results - page 9 / 10
» Ensemble of SVMs for Incremental Learning
Sort
View
NIPS
2000
13 years 9 months ago
A New Approximate Maximal Margin Classification Algorithm
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
Claudio Gentile
IJCNN
2007
IEEE
14 years 1 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
13 years 11 months ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang
SADM
2010
128views more  SADM 2010»
13 years 6 months ago
Online training on a budget of support vector machines using twin prototypes
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
Zhuang Wang, Slobodan Vucetic
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
14 years 8 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee