Sciweavers

735 search results - page 5 / 147
» Margin based feature selection - theory and algorithms
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 8 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
COLT
2003
Springer
14 years 23 days ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
ESANN
2006
13 years 9 months ago
Efficient Forward Regression with Marginal Likelihood
We propose an efficient forward regression algorithm based on greedy optimization of marginal likelihood. It can be understood as a forward selection procedure which adds a new bas...
Ping Sun, Xin Yao
ICML
2006
IEEE
14 years 8 months ago
Maximum margin planning
Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to ...
Nathan D. Ratliff, J. Andrew Bagnell, Martin Zinke...
IJIT
2004
13 years 9 months ago
Genetic Algorithm for Feature Subset Selection with Exploitation of Feature Correlations from Continuous Wavelet Transform: a re
A genetic algorithm (GA) based feature subset selection algorithm is proposed in which the correlation structure of the features is exploited. The subset of features is validated a...
Gert Van Dijck, Marc M. Van Hulle, M. Wevers