In the Hilbert space reproducing the Gaussian kernel, projected data points are located on an hypersphere. Following some recent works on geodesic analysis on that particular manifold, we propose a method which purpose is to select a subset of input data by sampling the corresponding hypersphere. The selected data should represent correctly the input data, while also maximizing the diversity. We show how these two opposite objectives can be characterized in terms of Karcher variance optimization. The corresponding algorithms are defined and results are reported on toy datasets. This shows the interest of working on the kernelized festure space instead of the input space. © 2013 Springer-Verlag.
CITATION STYLE
Courty, N., & Burger, T. (2013). A kernel view on manifold sub-sampling based on Karcher variance optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8085 LNCS, pp. 751–758). https://doi.org/10.1007/978-3-642-40020-9_84
Mendeley helps you to discover research relevant for your work.