Sciweavers

576 search results - page 48 / 116
» Structured metric learning for high dimensional problems
Sort
View
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
14 years 3 months ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
ECAI
2010
Springer
13 years 6 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
CVPR
2011
IEEE
13 years 21 days ago
Generalized Group Sparse Classifiers with Application in fMRI Brain Decoding
The perplexing effects of noise and high feature dimensionality greatly complicate functional magnetic resonance imaging (fMRI) classification. In this paper, we present a novel f...
Bernard Ng, Rafeef Abugharbieh
PODC
2005
ACM
14 years 2 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
PAMI
2008
119views more  PAMI 2008»
13 years 9 months ago
Triplet Markov Fields for the Classification of Complex Structure Data
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
Juliette Blanchet, Florence Forbes