Sciweavers

1364 search results - page 233 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
75
Voted
JMLR
2010
191views more  JMLR 2010»
14 years 5 months ago
Noise-contrastive estimation: A new estimation principle for unnormalized statistical models
We present a new estimation principle for parameterized statistical models. The idea is to perform nonlinear logistic regression to discriminate between the observed data and some...
Michael Gutmann, Aapo Hyvärinen
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 1 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
NIPS
1997
15 years 12 days ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
CASES
2006
ACM
15 years 5 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
JMLR
2002
137views more  JMLR 2002»
14 years 10 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller