Building k-edge-connected neighborhood graph for distance-based data projection

Pattern Recognition Letters

Volumn 26, Issue 13, 2005, Pages 2015-2021

  Yang, Li ^a  

^a Parkview Campus   (United States)

Author keywords

Data projection; Dimensionality reduction; Manifold learning; Neighborhood graph

Indexed keywords

ALGORITHMS; DATA PROCESSING; PATTERN RECOGNITION;

DATA PROJECTION; DIMENSIONALITY REDUCTION; MANIFOLD LEARNING; NEIGHBORHOOD GRAPH;

GRAPH THEORY;

EID: 24344438672     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.03.021     Document Type: Article

References (15)

1. M. Balasubramanian, E.L. Schwartz, J.B. Tenenbaum, V. de Silva, and J.C. Langford The Isomap algorithm and topological stability Science 295 2002 7a
2. T.F. Cox, and M.A.A. Cox Multidimensional Scaling second ed. 2001 Chapman & Hall
3. P. Demartines, and J. Herault Curvilinear component analysis: A self-organizing neural network for nonlinear mapping of data sets IEEE Trans. Neural Networks 8 1 1997 148 154
4. J. Edmonds, and R.M. Karp Theoretical improvements in algorithmic efficiency for network flow problems J. ACM 19 2 1972 248 264
5. S. Even, and R.E. Tarjan Network flow and testing graph connectivity SIAM J. Comput. 4 4 1975 507 518
6. L.R. Ford, and D.R. Fulkerson Maximal flow through a network Can. J. Math. 8 1956 399 404
7. M.R. Garay, and D.S. Johnson Computers and Intractability: a Guide to the Theory of NP-completeness 1979 W.H. Freeman and Company New York
8. J. Kruskal On the shortest spanning subtree of a graph and the travelling salesman problem Proc. Amer. Math. Soc. 7 1 1956 48 50
9. Lee, J.A., Lendasse, A., Donckers, N., Verleysen, M., 2000. A robust nonlinear projection method. In: Proc. 8th European Symp. Artificial Neural Networks (ESANN2000), Bruges, Belgium.
10. J. Nešetřil, E. Milkovà, and H. Nešetř ilovà Otakar Boro̊vka on minimal spanning tree problem Discrete Math. 233 April 2001 3 36
11. J.J.W. Sammon A nonlinear mapping for data structure analysis IEEE Trans. Comput. C-18 5 1969 401 409
12. Tarjan, R.E., 1974. Testing graph connectivity. In: Proc. 6th Annual ACM Symp. on Theory of Computing (STOC'74), pp. 185-193.
13. J.B. Tenenbaum, V. de Silva, and J.C. Langford A global geometric framework for nonlinear dimensionality reduction Science 290 December 2000 2319 2323
14. Yang, L., 2004. k-edge connected neighborhood graph for geodesic distance estimation and nonlinear data projection. In: Proc. 17th Int. Conf. Pattern Recognition (ICPR'04), August, vol. 1, pp. 196-199, Cambridge, UK.
15. Zha, H., Zhang, Z., 2003. Isometric embedding and continuum ISOMAP. In Proc. 20th Int. Conf. Machine Learning (ICML'03), August, pp. 864-871, Washington, DC.