Sciweavers

8381 search results - page 1151 / 1677
» The security of machine learning
Sort
View
ICML
2008
IEEE
16 years 8 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ICML
2008
IEEE
16 years 8 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICML
2008
IEEE
16 years 8 months ago
Sequence kernels for predicting protein essentiality
The problem of identifying the minimal gene set required to sustain life is of crucial importance in understanding cellular mechanisms and designing therapeutic drugs. This work d...
Cyril Allauzen, Mehryar Mohri, Ameet Talwalkar
ICML
2008
IEEE
16 years 8 months ago
Exploration scavenging
We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evalua...
John Langford, Alexander L. Strehl, Jennifer Wortm...
ICML
2008
IEEE
16 years 8 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
« Prev « First page 1151 / 1677 Last » Next »