Sciweavers

957 search results - page 2 / 192
» From Margin to Sparsity
Sort
View
ICANN
2007
Springer
13 years 11 months ago
Selection of Basis Functions Guided by the L2 Soft Margin
Support Vector Machines (SVMs) for classification tasks produce sparse models by maximizing the margin. Two limitations of this technique are considered in this work: firstly, th...
Ignacio Barrio, Enrique Romero, Lluís Belan...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 3 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 6 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
NIPS
2003
13 years 6 months ago
Perspectives on Sparse Bayesian Learning
Recently, relevance vector machines (RVM) have been fashioned from a sparse Bayesian learning (SBL) framework to perform supervised learning using a weight prior that encourages s...
David P. Wipf, Jason A. Palmer, Bhaskar D. Rao
NIPS
2001
13 years 6 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson