Finding the Homology of Submanifolds with High Confidence from Random Samples
- First Online:
- 624 Downloads
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high-dimensional spaces. We consider the case where data are drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. We show how to “learn” the homology of the submanifold with high confidence. We discuss an algorithm to do this and provide learning-theoretic complexity bounds. Our bounds are obtained in terms of a condition number that limits the curvature and nearness to self-intersection of the submanifold. We are also able to treat the situation where the data are “noisy” and lie near rather than on the submanifold in question.
Unable to display preview. Download preview PDF.
- 4.Bjorner, A.: Topological methods. In: Graham, R., Grotschel, M., Lovasz, L. (eds.) Handbook of Combinatorics, pp. 1819–1872. North-Holland, Amsterdam (1995) Google Scholar
- 5.Chazal, F., Lieutier, A.: Weak feature size and persistent homology: computing homology of solids in ℝn from noisy data samples. Preprint Google Scholar
- 6.Cheng, S.W., Dey, T.K., Ramos, E.A.: Manifold reconstruction from point samples. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 1018–1027 (2005) Google Scholar
- 7.Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. In: Proceedings of the 21st Symposium on Computational Geometry, pp. 263–271 (2005) Google Scholar
- 8.Dey, T.K., Edelsbrunner, H., Guha, S.: Computational topology. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, pp. 109–143. AMS, Providence (1999) Google Scholar
- 10.Donoho, D., Grimes, C.: Hessian eigenmaps: new locally-linear embedding techniques for high-dimensional data. Preprint. Department of Statistics, Stanford University (2003) Google Scholar
- 12.Fischer, K., Gaertner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA), pp. 630–641 (2003) Google Scholar
- 19.Website for smallest enclosing ball algorithm. http://www2.inf.ethz.ch/personal/gaertner/miniball.html