Sciweavers

58 search results - page 3 / 12
» On Noise-Tolerant Learning of Sparse Parities and Related Pr...
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 4 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
ICPR
2006
IEEE
15 years 10 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
TNN
2010
176views Management» more  TNN 2010»
14 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
RSS
2007
151views Robotics» more  RSS 2007»
14 years 11 months ago
Predicting Partial Paths from Planning Problem Parameters
— Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter p...
Sarah Finney, Leslie Pack Kaelbling, Tomás ...