9 search results - page 1 / 2 » Convex incremental extreme learning machine |
IJON
2007
13 years 5 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
IJON
2008
13 years 5 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
ICDM
2009
IEEE
14 years 8 days ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...