Sciweavers

44 search results - page 4 / 9
» Learning and Approximating the Optimal Strategy to Commit To
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 9 days ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last
ECML
2007
Springer
14 years 1 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
NECO
2008
112views more  NECO 2008»
13 years 7 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
SAB
2010
Springer
226views Optimization» more  SAB 2010»
13 years 6 months ago
Distributed Online Learning of Central Pattern Generators in Modular Robots
Abstract. In this paper we study distributed online learning of locomotion gaits for modular robots. The learning is based on a stochastic approximation method, SPSA, which optimiz...
David Johan Christensen, Alexander Spröwitz, ...

Publication
433views
14 years 4 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre