4 search results - page 1 / 1 » Semi-supervised Learning with Penalized Probabilistic Cluste... |
ICMCS
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
NIPS
2004
13 years 5 months ago
2004
While clustering is usually an unsupervised operation, there are circumstances in which we believe (with varying degrees of certainty) that items A and B should be assigned to the...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
CORR
2012
Springer
12 years 6 hour ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...