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...
We introduce confidence-weighted linear classifiers, which add parameter confidence information to linear classifiers. Online learners in this setting update both classifier param...
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
We show a close relationship between the Expectation - Maximization (EM) algorithm and direct optimization algorithms such as gradientbased methods for parameter learning. We iden...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...