| M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Mach. Learn., 56: 209--239, 2004. |
....margin of C on the unlabeled data, effectively assume that C is maximally smooth with respect to the density of unlabeled data in feature space. The Laplacian method of Belkin and Niyogi assumes the data concentrate on a low dimensional (Riemannian) manifold, and that C is smooth on that manifold [2]. The manifold geometry is estimated from the unlabeled data using simple bottom up techniques based on a graph of nearest neighbors. This approach performs quite well in classifying data with a natural manifold structure, e.g. handwritten digits. Methods of [3] and [4] combine aspects of both ....
....features of objects, X u , given ) We can estimate through more or less sophisticated means. The experiments in Section 3 use a greedy bottomup method (average link agglomerative clustering on the full data X) that is comparable in complexity to the neighborhood graph constructions used in [2]. 3 Experiments: tree based versus manifold based approaches We compared four algorithms: TBB, TNN, the Laplacian approach of Belkin and Niyogi, and generic Nearest Neighbor. We used four data sets which we expected to have a tree like structure, because they arose from biological taxonomies ....
M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. 2002. Submitted to Journal of Machine Learning Research.
No context found.
M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Mach. Learn., 56: 209--239, 2004.
No context found.
M. Belkin and P. Niyogi. Semi-Supervised Learning on Riemannian Manifolds. Machine Learning, 56(1-3):209--239, 2004.
No context found.
M. Belkin and P. Niyogi, "Semi-supervised learning on Riemannian manifolds," Machine Learning, to appear, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC