Building connected neighborhood graphs for locally linear embedding

Proceedings - International Conference on Pattern Recognition

Volumn 4, Issue , 2006, Pages 194-197

  Yang, Li ^a  

^a Western Michigan University   (United States)

Author keywords

Dimensionality reduction; Locally linear embedding; Manifold learning

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; LEARNING SYSTEMS;

DIMENSIONALITY REDUCTION; LOCALLY LINEAR EMBEDDING; MANIFOLD LEARNING;

GRAPHIC METHODS;

EID: 34147146900     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2006.345     Document Type: Conference Paper

References (10)

1. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19(2):248-264, Apr. 1972.
2. L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
3. J. Kruskal. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc., 7(1):48-50, 1956.
4. S. T. Roweis and L. K. Saul. Nonlineaar dimensionality reduction by locally linear embedding. Science, 290:2323-2326, Dec. 2000.
5. L. K. Saul and S. T. Roweis. Think globally, fit locally: Unsupervised learning of low dimensional manifolds. J. Machine Learning Research, 4:119-155, June 2003.
6. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, Dec. 2000.
7. L. Yang, k-edge connected neighborhood graph for geodesic distance estimation and nonlinear data projection. In Proc. 17th Inter. Conf. Pattern Recognition (ICPR'04), volume 1, pages 196-199, Cambridge, UK, Aug. 2004.
8. L. Yang. Building k-edge-connected neighborhood graphs for distance-based data projection. Pattern Recognition Letters, 26(13):2015-2021, Oct. 2005.
9. L. Yang. Building k edge-disjoint spanning trees of minimum total length for isometric data embedding. IEEE Trans. Pattern Analysis and Machine Intelligence, 27(10): 1680-1683, Oct. 2005.
10. L. Yang. Building k-connected neighborhood graphs for isometric data embedding. IEEE Trans. Pattern Analysis and Machine Intelligence, 28(5):827-831, May 2006.