Consistent Image Analogies using Semi-supervised Learning (2008)
Cheng, Li, Vishwanathan, SVN, Zhang, Xinhua
In this paper we study the following problem: given two source images A and A0, and a target image B, can we learn to synthesize a new image B0 which relates to B in the same way that A0 relates to...
Kernel Enabled K-Means Algorithm (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a novel method to learn arbitrary cluster boundaries by extending the k-means algorithm to use Mercer kernels. We inter- pret each cluster centroid as a linear com- bination of the cluster...
Use of Multi Category Proximal SVM for Dataset Reduction (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a tutorial introduction to Support Vector Machines (SVM) and try to show, using intuitive arguments, why SVM's tend to perform so well on a variety of challenging problems. We then discuss...
Geometric SVM: A Fast and Intuitive SVM Algorithm (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a geometrically motivated algorithm for finding the Support Vectors of a given set of points. This algorithm is reminiscent of the DirectSVM algorithm, in the way it picks data points for...
Kernel Enabled K-Means Algorithm (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a novel method to learn arbitrary cluster boundaries by extending the k-means algorithm to use Mercer kernels. We inter- pret each cluster centroid as a linear com- bination of the cluster...
Use of Multi Category Proximal SVM for Dataset Reduction (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a tutorial introduction to Support Vector Machines (SVM) and try to show, using intuitive arguments, why SVM's tend to perform so well on a variety of challenging problems. We then discuss...
Geometric SVM: A Fast and Intuitive SVM Algorithm (2002)
Vishwanathan, SVN, Murty, Narasimha M
We present a geometrically motivated algorithm for finding the Support Vectors of a given set of points. This algorithm is reminiscent of the DirectSVM algorithm, in the way it picks data points for...
Kohonen's SOM with cache (2000)
Vishwanathan, SVN, Murty, Narasimha M
The Kohonen self-organizing map (SOM),is a topology-preserving map that maps data from higher dimensions onto a (typically) two-dimensional grid of lattice points [1]. The aim of self-organization is...
Kohonen's SOM with cache (2000)
Vishwanathan, SVN, Murty, Narasimha M
The Kohonen self-organizing map (SOM),is a topology-preserving map that maps data from higher dimensions onto a (typically) two-dimensional grid of lattice points [1]. The aim of self-organization is...