Building k edge-disjoint spanning trees of minimum total length for isometric data embedding

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 27, Issue 10, 2005, Pages 1680-1683

  Yang, Li ^a  

^a Western Michigan University   (United States)

Author keywords

Data embedding; Dimensionality reduction; Manifold learning; Minimum spanning tree; Neighborhood graph

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; GRAPH THEORY; MATRIX ALGEBRA; TREES (MATHEMATICS);

DATA EMBEDDING; DIMENSIONALITY REDUCTION; MANIFOLD LEARNING; MINIMUM SPANNING TREE; NEIGHBORHOOD GRAPH;

PATTERN RECOGNITION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; DATA BASE; EVALUATION; FACTUAL DATABASE; INFORMATION RETRIEVAL; METHODOLOGY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATABASE MANAGEMENT SYSTEMS; DATABASES, FACTUAL; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED;

EID: 27644599805     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2005.192     Document Type: Article

References (12)

1. M. Balasubramanian, E.L. Schwartz, J.B. Tenenbaum, V. de Silva, and J.C. Langford, "The Isomap Algorithm and Topological Stability," Science, vol. 295, p. 7a, Jan. 2002.
2. T.F. Cox and M.A.A. Cox, Multidimensional Scaling, second ed. Chapman & Hall, 2001.
3. P. Demartines and J. Herault, "Curvilinear Component Analysis: A Self-Organizing Neural Network for Nonlinear Mapping of Data Sets," IEEE Trans. Neural Networks, vol. 8, no. 1, pp. 148-154, Jan. 1997.
4. M.R. Garay and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company, 1979.
5. J.J.W. Sammon, "A Nonlinear Mapping for Data Structure Analysis," IEEE Trans. Computers, vol. 18, no. 5, pp. 401-409, May 1969.
6. J. Kruskal, "On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem," Proc. Am. Math. Soc., vol. 7, no. 1, pp. 48-50, 1956.
7. J.A. Lee, A. Lendasse, N. Donckers, and M. Verleysen, "A Robust Nonlinear Projection Method," Proc. Eighth European Symp. Artificial Neural Networks, pp. 13-20, Apr. 2000.
8. S.T. Roweis and L.K. Saul, "Nonlinear Dimensionality Reduction by Locally Linear Embedding," Science, vol. 290, pp. 2323-2326, Dec. 2000.
9. H.S. Seung and D. Lee, "The Manifold Ways of Perception," Science, vol. 290, pp. 2268-2269, Dec. 2000.
10. J.B. Tenenbaum, V. de Silva, and J.C. Langford, "A Global Geometric Framework for Nonlinear Dimensionality Reduction," Science, vol. 290, pp. 2319-2323, Dec. 2000.
11. L. Yang, "k-Edge Connected Neighborhood Graph for Geodesic Distance Estimation and Nonlinear Data Projection," Proc. 17th Int'l Conf. Pattern Recognition, vol. 1, pp. 196-199, Aug. 2004.
12. H. Zha and Z. Zhang, "Isometric Embedding and Continuum ISOMAP," Proc. 20th Int'l Conf. Machine Learning, pp. 864-871, Aug. 2003.