Tree preserving embedding

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 753-760

  Shieh, Albert D ^a   Hashimoto, Tatsunori B ^a   Airoldi, Edoardo M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER SEPARATION; COMPLEX DATA; EXPLORATORY DATA ANALYSIS; FINITE SAMPLES; HIGH DIMENSIONAL DATA; LOW-DIMENSIONAL SPACES; TOPOLOGICAL NOTIONS; VISUALIZATION METHOD; VISUALIZATION TECHNIQUE;

DATA REDUCTION; LEARNING SYSTEMS; PLANT EXTRACTS; SAMPLING; SEPARATION; TREES (MATHEMATICS); VISUALIZATION;

DATA VISUALIZATION;

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

References (34)

1. Althscul, S F, Gish, W, Miller, W, Myers, E W, and Lipman, D J. Basic local alignment search tool. J Mol Biol, 215:403-410, 1990.
2. Atchley, W R, Zhao, J, Fernandes, A D, and Drüke, T. Solving the protein sequence metric problem. Proc Natl Acad Sci USA, 102:6395-6400, 2005. (Pubitemid 40617454)
3. Belkin, M and Niyogi, P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput, 15:1373-1396, 2003. (Pubitemid 37049796)
4. Buja, A, Swayne, D F, Littman, M L, Dean, N, Hofmann, H, and Chen, L. Data visualization with multidimensional scaling. J Comput Graph Stat, 17:444-472, 2008.
5. Carlsson, G and Mémoli, F. Characterization, stability and convergence of hierarchical clustering methods. J Mach Learn Res, 11:1425-1470, 2010.
6. Carreira-Perpinán, M A. The elastic embedding algorithm for dimensionality reduction. In Proceedings of the 27th International Conference on Machine Learning, 2010.
7. Chen, L and Buja, A. Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis. J Am Stat Assoc, 104:209-219, 2009.
8. Cook, J A, Sutskever, I, Mnih, A, and Hinton, G E. Visualizing similarity data with a mixture of maps. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, 2007.
9. De Silva, V and Tenenbaum, J B. Global versus local methods for nonlinear dimensionality reduction. In Advances in Neural Information Processing Systems, volume 15, 2003.
10. Di Battista, G, Eades, P, Tamassia, R, and Tollis, I G. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, New York, 1998.
11. Eades, P. The realization problem for euclidean minimum spanning trees is np-hard. Algorithmica, 16:60-82, 1996. (Pubitemid 126418816)
12. Gower, J C and Dijksterhuis, G B. Procrustes Problems. Oxford University Press, Oxford, 2004.
13. Gower, J C and Ross, G J S. Minimum spanning trees and single linkage cluster analysis. Appl Stat, 18:54-64, 1969.
14. Hartigan, J A. Clustering Algorithms. Wiley, New York, 1975.
15. Hartigan, J A. Statistical theory in clustering. J Classif, pp. 63-76, 1985.
16. Hinton, G E and Roweis, S T. Stochastic neighbor embedding. In Advances in Neural Information Processing Systems, volume 15, 2003.
17. Hull, J J. A database for handwritten text recognition research. IEEE T Pattern Anal, 16:550-554, 1994.
18. Johnson, S C. Hierarchical clustering schemes. Psychometrika, 32:241-254, 1967.
19. Kaufmann, M and Wagner, D. Drawing Graphs: Methods and Models. Springer-Verlag, New York, 2001.
20. Mardia, K V, Kent, J T, and Bibby, J M. Multivariate Analysis. Academic Press, London, 1979.
21. Pollack, J D, Li, Q, and K, Pearl D. Taxonomic utility of a phylogenetic analysis of phosphoglycerate kinase proteins of archaea, bacteria, and eukaryota: Insights by bayesian analyses. Mol Phylogenet Evol, 35:420-430, 2005.
22. Quist, M and Yona, G. Distributional scaling: an algorithm for structure-preserving embedding of metric and non-metric spaces. J Mach Learn Res, 5:399-420, 2004.
23. Roth, V, Laub, J, Kawanabe, M, and Buhmann, J M. Optimal cluster preserving embedding of nonmetric proximity data. IEEE T Pattern Anal, 25:1540-1551, 2003.
24. Roweis, S T and Saul, L K. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000. (Pubitemid 32041578)
25. Saul, L K and Roweis, S T. Think globally, fit locally: Unsupervised learning of low dimensional manifolds. J Mach Learn Res, 4:119-155, 2003.
26. Shaw, B and Jebara, T. Structure preserving embedding. In Proceedings of the 26th International Conference on Machine Learning, 2009.
27. Shepard, R N. Multidimensional scaling, tree-fitting, and clustering. Science, 210:390-398, 1980.
28. Sigillito, V G, Wing, S P, Hutton, L V, and Baker, K B. Classification of radar returns from the ionosphere using neural networks. J Hopkins Apl Tech D, 10:262-266, 1989.
29. Stuetzle, W. Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J Classif, 20:25-47, 2003. (Pubitemid 36742925)
30. Tenenbaum, J B, De Silva, V, and Langford, J C. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000. (Pubitemid 32041577)
31. van der Maaten, L and Hinton, G E. Visualizing data using t-sne. J Mach Learn Res, 9:2579-2605, 2008.
32. Venna, J, Peltonen, J, Nybo, K, Aidos, H, and Samuel, K. Information retrieval perspective to nonlinear dimensionality reduction for data visualization. J Mach Learn Res, 11:451-490, 2010.
33. Xing, E P, Ng, A Y, Jordan, M I, and Russell, S. Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems, volume 14, 2002.
34. Zadeh, R B and Ben-David, S. A uniqueness theorem for clustering. In Proceedings of the 25th Annual Conference on Uncertainty in Artificial Intelligence, 2009.