Tree preserving embedding

Proceedings of the National Academy of Sciences of the United States of America

Volumn 108, Issue 41, 2011, Pages 16916-16921

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

^a HARVARD UNIVERSITY   (United States)

Author keywords

Hierarchical clustering; Multidimensional scaling

Indexed keywords

PHOSPHOGLYCERATE KINASE;

ARTICLE; CLASSIFICATION ALGORITHM; CLUSTER ANALYSIS; CONTROLLED STUDY; EMBEDDING; LINKAGE ANALYSIS; MEMBRANE STRUCTURE; MOLECULAR BIOLOGY; MULTIFACTOR DIMENSIONALITY REDUCTION; PHYLOGENETIC TREE; PRIORITY JOURNAL; SIGNAL TRANSDUCTION; SINGLE LINKAGE ANALYSIS; TREE PRESERVING EMBEDDING;

ALGORITHMS; CLUSTER ANALYSIS; DATA INTERPRETATION, STATISTICAL; HANDWRITING; MODELS, STATISTICAL; RADAR; SEQUENCE ANALYSIS, PROTEIN;

EID: 80054747526     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1018393108     Document Type: Article

References (41)

1. Shiffrin RM, Börner K (2004) Mapping knowledge domains. Proc Natl Acad Sci USA 101:5183-5185. (Pubitemid 38469124)
2. Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313:504-507. (Pubitemid 44148451)
3. Joliffe IT (2002) Principal Component Analysis (Springer, New York).
4. Kruskal JB, Wish M (1978) Multidimensional Scaling (Sage Univ Press, Newbury Park).
5. Cox TF, Cox MAA (2001) Multidimensional Scaling (Chapman & Hall/CRC, Boca Raton).
6. Borg I, Groenen P (2005) Modern Multidimensional Scaling: Theory and Applications (Springer, New York).
7. Tenenbaum JB, de Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290:2319-2323. (Pubitemid 32041577)
8. Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290:2323-2326. (Pubitemid 32041578)
9. Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15:1373-1396. (Pubitemid 37049796)
10. Venna J, Peltonen J, Nybo K, Aidos H, Samuel K (2010) Information retrieval perspective to nonlinear dimensionality reduction for data visualization. J Mach Learn Res 11:451-490.
11. van der Maaten L, Hinton GE (2008) Visualizing data using t-sne. J Mach Learn Res 9:2579-2605.
12. Roth V, Laub J, Kawanabe M, Buhmann JM (2003) Optimal cluster preserving embedding of nonmetric proximity data. IEEE Trans Pattern Anal Mach Intell 25:1540-1551.
13. Xing EP, Ng AY, Jordan MI, Russell S (2002) Distance metric learning, with application to clustering with side-information. Adv Neural Inf Process Syst 14:521-528.
14. Hinton GE, Roweis ST (2003) Stochastic neighbor embedding. Adv Neural Inf Process Syst 15:857-864.
15. Cook JA, Sutskever I, Mnih A, Hinton GE (2007) Visualizing similarity data with a mixture of maps. Proceedings of the 11th International Conference on Artificial Intelligence and Statistics.
16. Carreira-Perpi nán MA (2010) The elastic embedding algorithm for dimensionality reduction. Proceedings of the 27th International Conference on Machine Learning (Omnipress, Haifa, Israel).
17. Chen L, Buja A (2009) Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis. J Am Stat Assoc 104:209-219.
18. Di Battista G, Eades P, Tamassia R, Tollis IG (1998) Graph Drawing: Algorithms for the Visualization of Graphs (Prentice Hall, New York).
19. Kaufmann M, Wagner D (2001) Drawing Graphs: Methods and Models (Springer, New York).
20. Shepard RN (1980) Multidimensional scaling, tree-fitting, and clustering. Science 210:390-398.
21. Gower JC, Ross GJS (1969) Minimum spanning trees and single linkage cluster analysis. Appl Stat 18:54-64.
22. Zadeh RB, Ben-David S (2009) A uniqueness theorem for clustering. Proceedings of the 25th Annual Conference on Uncertainty in Artificial Intelligence (AUAI Press, Montreal).
23. Shaw B, Jebara T (2009) Structure preserving embedding. Proceedings of the 26th International Conference on Machine Learning (ACM, Montreal).
24. Eades P (1996) The realization problem for euclidean minimum spanning trees is np-hard. Algorithmica 16:60-82.
25. Hartigan JA (1975) Clustering Algorithms (Wiley, New York).
26. Hartigan JA (1985) Statistical theory in clustering. J Classif 2:63-76.
27. Stuetzle W (2003) Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J Classif 20:25-47.
28. Buja A, et al. (2008) Data visualization with multidimensional scaling. J Comput Graph Stat 17:444-472.
29. Johnson SC (1967) Hierarchical clustering schemes. Psychometrika 32:241-254.
30. Carlsson G, Mémoli F (2010) Characterization, stability and convergence of hierarchical clustering methods. J Mach Learn Res 11:1425-1470.
31. Qiu H, Hancock ER (2007) Clustering and embedding using commute times. IEEE Trans Pattern Anal Mach Intell 29:1873-1890.
32. Gower JC, Dijksterhuis GB (2004) Procrustes Problems (Oxford Univ Press, Oxford).
33. Quist M, Yona G (2004) Distributional scaling: An algorithm for structure-preserving embedding of metric and non-metric spaces. J Mach Learn Res 5:399-420.
34. de Silva V, Tenenbaum JB (2003) Global versus local methods for nonlinear dimensionality reduction. Adv Neural Inf Process Syst 15:705-712.
35. Pollack JD, Li Q, Pearl DK (2005) 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. (Pubitemid 40413407)
36. Atchley WR, Zhao J, Fernandes AD, Drüke T (2005) Solving the protein sequence metric problem. Proc Natl Acad Sci USA 102:6395-6400. (Pubitemid 40617454)
37. Althscul SF, GishW, MillerW, Myers EW, Lipman DJ (1990) Basic local alignment search tool. J Mol Biol 215:403-410.
38. Sigillito VG, Wing SP, Hutton LV, Baker KB (1989) Classification of radar returns from the ionosphere using neural networks. Johns Hopkins Apl Tech Dig 10:262-266.
39. Hull JJ (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal Mach Intell 16:550-554.
40. Saul LK, Roweis ST (2003) Think globally, fit locally: Unsupervised learning of low dimensional manifolds. J Mach Learn Res 4:119-155.
41. Hartigan JA (1981) Consistency of single linkage for high-density clusters. J Am Stat Assoc 76:388-394.