Estimating local intrinsic dimension with k-nearest neighbor graphs

IEEE Workshop on Statistical Signal Processing Proceedings

Volumn 2005, Issue , 2005, Pages 417-421

  Costa, Jose A ^a   Girotra, Abhishek ^a   Hero III, Alfred O ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Intrinsic dimension; Manifold learning; Nearest neighbor graph

Indexed keywords

INTRINSIC DIMENSION; MANIFOLD LEARNING; NEAREST NEIGHBOR GRAPH;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; TOPOLOGY;

PARAMETER ESTIMATION;

EID: 33947102638     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. "Manifold learning resource page," http://www.cse.msu.edu/ ~lawhiu/manifold/.
2. F. Camastra and A. Vinciarelli, "Estimating the intrinsic dimension of data with a fractal-based method," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 24, no. 10, pp. 1404-1407, October 2002.
3. B. Kégl, "Intrinsic dimension estimation using packing numbers," in Neural Information Processing Systems: NIPS, Vancouver, CA, Dec. 2002.
4. J. A. Costa and A. O. Hero, "Geodesic entropic graphs for dimension and entropy estimation in manifold learning," IEEE Trans. on Signal Processing, vol. 52, no. 8, pp. 2210-2221, August 2004.
5. J. A. Costa and A. O. Hero, "Entropic graphs for manifold learning," in Proc. of IEEE Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, November 2003.
6. E. Levina and P. Bickel, "Maximum likelihood estimation of intrinsic dimension," in Neural Information Processing Systems: NIPS, Vancouver, CA, Dec. 2004.
7. H. Edelsbrummer, M. Facello, and J. Liang, "On the definition and the construction of pockets on macromolecules," Discrete Applied Math., vol. 88, pp. 83-102, 1998.
8. M. Carmo, Riemannian geometry, Birkhäuser, Boston, 1992.
9. J. E. Yukich, Probability theory of classical Euclidean optimization problems, vol. 1675 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1998.
10. A. Hero, J. Costa, and B. Ma, "Convergence rates of minimal graphs with random vertices," submitted to IEEE Trans. on Inform. Theory, 2003. www.eecs.umich.edu/~hero/det_est.html.
11. J. Giesen and U. Wagner, "Shape dimension and intrinsic metric from samples of manifolds," in Proceedings of the 19th Annual ACM Symposium on Computational Geometry, 2003.
12. P. Grassberger and I. Procaccia, "Measuring the stangeness of strange attractors," Physica D, vol. 9, pp. 189-208, 1983.
13. K. Pettis, T. Bailey, A. Jain, and R. Dubes, "An intrinsic dimensionality estimator from near-neighbor information," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 1, no. 1, pp. 25-36, 1979.
14. G. S. Watson, Statistics on Spheres, John Wiley & Sons, 1983.