Sciweavers

1062 search results - page 61 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2007
IEEE
14 years 9 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
ICML
2006
IEEE
14 years 9 months ago
A continuation method for semi-supervised SVMs
Semi-Supervised Support Vector Machines (S3 VMs) are an appealing method for using unlabeled data in classification: their objective function favors decision boundaries which do n...
Olivier Chapelle, Mingmin Chi, Alexander Zien
ICML
2009
IEEE
14 years 9 months ago
Optimized expected information gain for nonlinear dynamical systems
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...
Alberto Giovanni Busetto, Cheng Soon Ong, Joachim ...
ICML
2000
IEEE
14 years 9 months ago
Bayesian Averaging of Classifiers and the Overfitting Problem
Although Bayesian model averaging is theoretically the optimal method for combining learned models, it has seen very little use in machine learning. In this paper we study its app...
Pedro Domingos
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 11 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich