Sciweavers

169 search results - page 28 / 34
» Weighted and Robust Incremental Method for Subspace Learning
Sort
View
ECML
2004
Springer
14 years 26 days ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
CVPR
2006
IEEE
14 years 9 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
ICRA
2005
IEEE
138views Robotics» more  ICRA 2005»
14 years 1 months ago
Urban Object Recognition from Informative Local Features
Abstract— Autonomous mobile agents require object recognition for high level interpretation and localization in complex scenes. In urban environments, recognition of buildings mi...
Gerald Fritz, Christin Seifert, Lucas Paletta
NN
2010
Springer
125views Neural Networks» more  NN 2010»
13 years 5 months ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
EVOW
2010
Springer
13 years 10 months ago
Improving Multi-Relief for Detecting Specificity Residues from Multiple Sequence Alignments
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...
Elena Marchiori