Figure 1 - uploaded by Shankar Rao
Content may be subject to copyright.
Left: Two Spiral Problem. Middle: SVM + RBF Kernel. Right: SVM + Polynomial Kernel 

Left: Two Spiral Problem. Middle: SVM + RBF Kernel. Right: SVM + Polynomial Kernel 

Source publication
Article
Full-text available
We propose a method for learning the intrinsic topol- ogy of a point set sampled from a curve embedded in a high-dimensional ambient space. Our approach does not rely on distances in the ambient space, and thus can recover the topology of sparsely sampled curves, a sit- uation where extant manifold learning methods are ex- pected to fail. We formul...

Context in source publication

Context 1
... this performance significantly deteriorates when the sample size is reduced. For example, consider the instance of the problem shown in Figure 1 This observation is not very surprising as these kernels are well suited for spherical-shaped distributions while here each spiral is a thin curve. Thus, manifold learning seems to be a more promising avenue for learning such structure of more sparsely sampled datasets. ...

Similar publications

Article
Full-text available
In this paper we propose an heuristic to improve the performances of the recently proposed derivative-free method for nonsmooth optimization CS-DFN. The heuristic is based on a clustering-type technique to compute an estimate of Clarke’s generalized gradient of the objective function, obtained via calculation of the (approximate) directional deriva...
Preprint
Full-text available
We find a duality between two well-known trees, the Calkin-Wilf tree and the Stern-Brocot tree, derived from cluster algebra theory. The vertex sets of these trees are the set of rational numbers, and they have cluster structures induced by one-punctured torus. In particular, the Calkin-Wilf tree is an example of the structure given by initial-seed...
Article
Full-text available
The paper deals with the problem of constructing Gaussian membership functions of fuzzy sets for fuzzy rules derived from the data by using heuristic algorithms of possibilistic clustering. Basic concepts of the heuristic approach to possibilistic clustering are reminded and the extended technique of constructing membership functions of fuzzy sets...