Sciweavers

59 search results - page 10 / 12
» Robust regression using sparse learning for high dimensional...
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
NIPS
2004
13 years 8 months ago
Sampling Methods for Unsupervised Learning
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
Robert Fergus, Andrew Zisserman, Pietro Perona
ACII
2005
Springer
13 years 9 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ECML
2006
Springer
13 years 11 months ago
Bayesian Active Learning for Sensitivity Analysis
Abstract. Designs of micro electro-mechanical devices need to be robust against fluctuations in mass production. Computer experiments with tens of parameters are used to explore th...
Tobias Pfingsten