Sciweavers

1062 search results - page 168 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2005
IEEE
14 years 9 months ago
A new Mallows distance based metric for comparing clusterings
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
Ding Zhou, Jia Li, Hongyuan Zha
ICML
2004
IEEE
14 years 9 months ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao
ICML
2004
IEEE
14 years 9 months ago
Margin based feature selection - theory and algorithms
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
ICML
1997
IEEE
14 years 9 months ago
Characterizing the generalization performance of model selection strategies
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
Dale Schuurmans, Lyle H. Ungar, Dean P. Foster