Building connected neighborhood graphs for isometric data embedding

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 722-728

  Yang, Li ^a  

^a Parkview Campus   (United States)

Author keywords

Data embedding; Dimensionality reduction; Graph connectivity; Manifold learning

Indexed keywords

GRAPH THEORY; LEARNING SYSTEMS;

DATA EMBEDDING; DIMENSIONALITY REDUCTION; MANIFOLD LEARNING;

DATA MINING;

EID: 32344434821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081963     Document Type: Conference Paper

References (24)

1. M. Balasubramanian, E. L. Schwartz, J. B. Tenenbaum, V. de Silva, and J. C. Langford. The Isomap algorithm and topological stability. Science, 295:7a, Jan. 2002.
2. T. F. Cox and M. A. A. Cox. Multidimensional Scaling, 2nd Edition. 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, 8(1):148-154, Jan. 1997.
4. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19(2)-.248-264, Apr. 1972.
5. S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM J. Computing, 4(4):507-518, Dec. 1975.
6. L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
7. M. R. Garay and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
8. R. L. Graham and P. Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1):43-57, Jan. 1985.
9. J. J. W. Sammon. A nonlinear mapping for data structure analysis. IEEE Trans. Computers, C-18(5):401-409, May 1969.
10. J. Kruskal. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc., 7(1):48-50, 1956.
11. J. Kruskal. Multidimensional scaling by optimizing goodness-of-fit to a nonmetric hypothesis. Psychometrika, 29:1-27, 1964.
12. J. Kruskal. Comments on a nonlinear mapping for data structure alanysis. IEEE Trans. Computers, C-20(12):1614, Dec. 1971.
13. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
14. J. A. Lee, A. Lendasse, N. Donckers, and M. Verleysen. A robust nonlinear projection method. In Proc. 8th European Symp. Artificial Neural Networks (ESANN2000), Bruges, Belgium, Apr. 2000.
15. D. Matula. k-blocks and ultrablocks in graphs. Journal of Combinatorial Theory, Series B, 24(1):1-13, Feb. 1978.
16. H. Niemann and J. Weiss. A fast converging algorithm for nonlinear mapping of high-dimensional data onto a plane. IEEE Trans. Computers, C-28(2) .-142-147, Feb. 1979.
17. R. E. Tarjan. Testing graph connectivity. In Proc. 6th Annual ACM Symp. on Theory of Computing (STOC'74), pages 185-193, 1974.
18. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, Dec. 2000.
19. L. Yang. Distance-preserving projection of high dimensional data for nonlinear dimensionality reduction. IEEE Trans. Pattern Analysis and Machine Intelligence, 26(9):1243-1246, Sept. 2004.
20. 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.
21. L. Yang. Sammon's nonlinear mapping using geodesic distances. In Proc. 17th Inter. Conf. Pattern Recognition (ICPR'04), volume 2, pages 303-306, Cambridge, UK, Aug. 2004.
22. L. Yang. Building k-edge-connected neighborhood graphs for distance-based data projection. Pattern Recognition Letters, 26, 2005. To appear.
23. 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), Oct. 2005. To appear.
24. H. Zha and Z. Zhang. Isometric embedding and continuum ISOMAP. In Proc. 20th Inter. Conf. Machine Learning (ICML'03), pages 864-871, Washington, DC, Aug. 2003.