Distributional scaling: An algorithm for structure-preserving embedding of metric and nonmetric spaces

Journal of Machine Learning Research

Volumn 5, Issue , 2004, Pages 399-420

  Quist, Michael ^a   Yona, Golan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Earth mover's distance; Embedding; Multidimensional scaling; PCA

Indexed keywords

ALGORITHMS; GEOMETRY;

CONVERGENCE PROPERTIES; DISTRIBUTIONAL INFORMATION; EARTH MOVER'S DISTANCE; EMBEDDING; LOW-DIMENSIONAL REPRESENTATION; MULTI-DIMENSIONAL SCALING; MULTIDIMENSIONAL SCALING TECHNIQUES; PCA;

CLUSTERING ALGORITHMS;

EID: 84925711202     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. D. K. Agrafiotis and H. Xu. A self-organizing principle for learning nonlinear manifolds. Proceedings of the National Academy of Arts and Sciences, 99:15869-15872, 2002.
2. I. Apostol and W. Szpankowski. Indexing and mapping of proteins using a modified nonlinear Sammon projection. Journal of Computational Chemistry, 20:1049-1059, 1999.
3. W. Basalaj. Incremental multidimensional scaling method for database visualization. In Visual Data Exploration and Analysis VI (Proceedings of the SPIE), volume 3643, pages 149-158, 1999.
4. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral eigenmaps for embedding and clustering. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems, volume 14, pages 585-591. The MIT Press, 2002.
5. M. Blatt, S. Wiseman, and E. Domani. Data clustering using a model granular magnet. Neural Computation, 9:1805-1842, 1997.
6. T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Chapman and Hall CRC, second edition, 2001.
7. D. L. Donoho and C. Grimes. Hessian eigenmaps: Locally linear embedding techniques for highdimensional data. Proceedings of the National Academy of Arts and Sciences, 100:5591-5596, 2003.
8. S. Dubnov, R. El-Yaniv, Y. Gdalyahu, E. Schneidman, N. Tishby, and G. Yona. A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles. Machine Learning, 47:35-61, 2002.
9. R. El-Yaniv, S. Fine, and N. Tishby. Agnostic classification of Markovian sequences. In M. I. Jordan, M. J. Kearns, and S. A. Solla, editors, Advances in Neural Information Processing Systems, volume 10, pages 465-471. The MIT Press, 1998.
10. Y. Gdalyahu, D. Weinshall, and M. Werman. A randomized algorithm for pairwise clustering. In M. S. Kearns, S. A. Solla, and D. A. Cohn, editors, Advances in Neural Information Processing Systems, volume 11, pages 424-430. The MIT Press, 1999.
11. J. C. Gower. Some distance properties of latent root and vector methods in multivariate analysis. Biometrika, 53:325-338, 1966.
12. H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24:417-441, 498-520, 1933.
13. A. J. Kearsley, R. A. Tapia, and M. W. Trosset. The solution of the metric STRESS and SSTRESS problems in multidimensional scaling using Newton's method. Computational Statistics, 13:369-396, 1998.
14. R. W. Klein and R. C. Dubes. Experiments in projection and clustering by simulated annealing. Pattern Recognition, 22:213-220, 1989.
15. H. Klock and J. M. Buhmann. Multidimensional scaling by deterministic annealing. In Proceedings of the International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, pages 245-260, 1997.
16. S. Kullback. Information Theory and Statistics. John Wiley and Sons, 1959.
17. E. Levina and P. Bickel. The earth mover's distance is the Mallows distance: Some insights from statistics. In Proceedings of the Eighth IEEE International Conference on Computer Vision, pages 251-256, 2001.
18. J. Lin. Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory, 37(1):145-151, 1991.
19. N. Linial, E. London, and Yu. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
20. S. W. Malone and M. W. Trosset. A study of the stationary configurations of the SSTRESS criterion for metric multidimensional scaling. Technical Report 00-06, Department of Computational & Applied Mathematics, Rice University, 2000.
21. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, second edition, 1993.
22. V. Roth, J. Laub, M. Kawanabe, and J. M. Buhmann. Optimal cluster preserving embedding of non-metric proximity data. Technical Report IAI-TR-2002-5, University of Bonn, Informatik III, 2002.
23. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000.
24. Y. Rubner, C. Tomasi, and L. B. Guibas. A metric for distributions with applications to image databases. In Proceedings of the Sixth IEEE International Conference on Computer Vision, pages 59-66, 1998.
25. J. W. Sammon. A nonlinear mapping for data structure analysis. IEEE Transactions on Computers, 18:401-409, 1969.
26. L. K. Saul and S. T. Roweis. Think globally, fit locally: Unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research, 4:119-155, 2003.
27. J. Shi and J. Malik. Normalized cuts and image segmentation. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pages 731-737, 1997.
28. P. S. Smith. Threshold validity for mutual neighborhood clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 15:89-92, 1993.
29. J. B. Tenenbaum, V. De Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
30. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. PAMI, 15:1101-1113, 1993.
31. G. Yona. Methods for Global Organization of the Protein Sequence Space. PhD thesis, The Hebrew University, Jerusalem, Israel, 1999.
32. G. Young and A. S. Householder. Discussion of a set of points in terms of their mutual distances. Psychometrika, 3:19-22, 1938.