1622 search results - page 78 / 325 » Learning a Hidden Matching |
114
click to vote
IUI
2004
ACM
15 years 8 months ago
2004
ACM
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
129
click to vote
NIPS
1998
15 years 4 months ago
1998
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
129
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
101
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Moment matching is a popular means of parametric density estimation. We extend this technique to nonparametric estimation of mixture models. Our approach works by embedding distri...
128
click to vote
AAAI
2012
13 years 5 months ago
2012
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...