Entropic graphs for manifold learning

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 1, Issue , 2003, Pages 316-320

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

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPIC GRAPHS; GEODESIC MINIMAL SPANNING TREES (GMST); LINEAR LOCAL IMBEDDING (LLE); MANIFOLD LEARNING;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; ENTROPY; FEATURE EXTRACTION; GRAPH THEORY; LEARNING SYSTEMS; REGRESSION ANALYSIS;

IMAGE PROCESSING;

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

References (16)

1. S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear imbedding," Science, vol. 290, no. 1, pp. 2323-2326, 2000.
2. J. B. Tenenbaum, V. de Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, pp. 2319-2323, 2000.
3. M. Kirby, Geometric Data Analysis: An Empirical Approach to Dimensionality Reduction and the Study of Patterns, Wiley-Interscience, 2001.
4. D. Donoho and C. Grimes, "Hessian eigenmaps: new locally linear embedding techniques for high dimensional data," Tech. Rep. TR2003-08, Dept. of Statistics, Stanford University, 2003.
5. A. K. Jain and R. C. Dubes, Algorithms for clustering data, Prentice Hall, Englewood Cliffs, NJ, 1988.
6. T. Cox and M. Cox, Multidimensional Scaling, Chapman & Hall, London, 1994.
7. X. Huo and J. Chen, "Local linear projection (LLP)," in Proc. of First Workshop on Genomic Signal Processing and Statistics (GENSIPS), 2002.
8. P. Verveer and R. Duin, "An evaluation of intrinsic dimensionality estimators," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 17, no. 1, pp. 81-86, January 1995.
9. 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.
10. B. K'egl, "Intrinsic dimension estimation using packing numbers," in Neural Information Processing Systems: NIPS, Vancouver, CA, Dec. 2002.
11. A.O. Hero, B. Ma, O. Michel, and J. Gorman, "Applications of entropic spanning graphs," IEEE Signal Processing Magazine, vol. 19, no. 5, pp. 85-95, October 2002.
12. J. A. Costa and A. O. Hero, "Geodesic minimal spanning trees for dimension and entropy estimation in manifold learning," IEEE Trans. on Signal Processing, 2003, under revision.
13. J. A. Costa and A. O. Hero, "Manifold learning using Euclidean k-neartest neighbor graphs," in preparation, 2003.
14. J. E. Yukich, Probability theory of classical Euclidean optimization problems, vol. 1675 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1998.
15. M. Carmo, Riemannian geometry, Birkhäuser, Boston, 1992.
16. V. de Silva and J. B. Tenenbaum, "Global versus local methods in nonlinear dimensionality reduction," in Neural Information Processing Systems 15 (NIPS), Vancouver, Canada, Dec. 2002.