We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...