Sciweavers

204 search results - page 29 / 41
» Learning locally minimax optimal Bayesian networks
Sort
View
NIPS
1992
14 years 10 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp
AI
2005
Springer
14 years 9 months ago
Fast Protein Superfamily Classification Using Principal Component Null Space Analysis
Abstract. The protein family classification problem, which consists of determining the family memberships of given unknown protein sequences, is very important for a biologist for ...
Leon French, Alioune Ngom, Luis Rueda
BTW
2005
Springer
113views Database» more  BTW 2005»
15 years 3 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
NIPS
1998
14 years 10 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
JMLR
2010
144views more  JMLR 2010»
14 years 4 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko