nips nips2006 nips2006-128 nips2006-128-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Matthias Hein, Markus Maier
Abstract: We consider the problem of denoising a noisily sampled submanifold M in Rd , where the submanifold M is a priori unknown and we are only given a noisy point sample. The presented denoising algorithm is based on a graph-based diffusion process of the point sample. We analyze this diffusion process using recent results about the convergence of graph Laplacians. In the experiments we show that our method is capable of dealing with non-trivial high-dimensional noise. Moreover using the denoising algorithm as pre-processing method we can improve the results of a semi-supervised learning algorithm. 1
[1] M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comp., 15(6):1373–1396, 2003.
[2] C. M. Bishop, M. Svensen, and C. K. I. Williams. GTM: The generative topographic mapping. Neural Computation, 10:215–234, 1998.
[3] O. Chapelle, B. Sch¨ lkopf, and A. Zien, editors. Semi-Supervised Learning. MIT Press, Cambridge, o 2006. in press, http://www.kyb.tuebingen.mpg.de/ssl-book.
[4] P. Grassberger and I. Procaccia. Measuring the strangeness of strange attractors. Physica D, 9:189–208, 1983.
[5] A. Grigoryan. Heat kernels on weighted manifolds and applications. Cont. Math., 398:93–191, 2006.
[6] T. Hastie and W. Stuetzle. Principal curves. J. Amer. Stat. Assoc., 84:502–516, 1989.
[7] M. Hein, J.-Y. Audibert, and U. von Luxburg. From graphs to manifolds - weak and strong pointwise consistency of graph Laplacians. In P. Auer and R. Meir, editors, Proc. of the 18th Conf. on Learning Theory (COLT), pages 486–500, Berlin, 2005. Springer.
[8] M. Hein, J.-Y. Audibert, and U. von Luxburg. Graph Laplacians and their convergence on random neighborhood graphs, 2006. accepted at JMLR, available at arXiv:math.ST/0608522.
[9] M. Hein. Geometrical aspects of statistical learning theory. PhD thesis, MPI f¨ r biologische Kyberu netik/Technische Universit¨ t Darmstadt, 2005. a
[10] D. Keysers, W. Macherey, H. Ney, and J. Dahmen. Adaptation in statistical pattern recognition using tangent vectors. IEEE Trans. on Pattern Anal. and Machine Intel., 26:269–274, 2004.
[11] C. Lange and K. Polthier. Anisotropic smoothing of point sets. Computer Aided Geometric Design, 22:680–692, 2005.
[12] O. Scherzer and J. Weickert. Relations between regularization and diffusion imaging. J. of Mathematical Imaging and Vision, 12:43–63, 2000.
[13] G. Taubin. A signal processing approach to fair surface design. In Proc. of the 22nd annual conf. on Computer graphics and interactive techniques (Siggraph), pages 351–358, 1995.
[14] J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319–2323, 2000.
[15] D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Sch¨ lkopf. Learning with local and global consistency. o In S. Thrun, L. Saul, and B. Sch¨ lkopf, editors, Adv. in Neur. Inf. Proc. Syst. (NIPS), volume 16. MIT o Press, 2004.