We propose the framework of mutual information kernels for learning covariance kernels, as used in Support Vector machines and Gaussian process classifiers, from unlabeled task da...
We present two methods for learning the structure of personal names from unlabeled data. The first simply uses a few implicit constraints governing this structure to gain a toehol...
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
In many real-world applications, such as image retrieval, it would be natural to measure the distances from one instance to others using instance specific distance which captures ...
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...