The metric nearness problem

SIAM Journal on Matrix Analysis and Applications

Volumn 30, Issue 1, 2008, Pages 375-396

  Brickell, Justin ^a   Dhillon, Inderjit S ^a   Suvrit, S R A ^a   Tropp, Joel A ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

All pairs shortest paths; Distance matrix; Matrix nearness problems; Metric; Metric nearness; Triangle inequality

Indexed keywords

APPROXIMATION ALGORITHMS; CONVEX OPTIMIZATION; GRAPH THEORY; INDEXING (MATERIALS WORKING); ITERATIVE METHODS;

ALL PAIRS SHORTEST PATHS; DISTANCE MATRICES; MATRIX NEARNESS PROBLEMS; METRIC; METRIC NEARNESS; TRIANGLE INEQUALITY;

CLUSTERING ALGORITHMS;

EID: 61849116168     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/060653391     Document Type: Article

References (28)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. Assoc. Comput. Mach., 45 (1998), pp. 501-555.
2. Y. CENSOR AND S. A. ZENIOS, Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, Oxford, 1997.
3. T. H. CORMEN, C. E. LEISERSON, R. RIVEST, AND C. STEIN, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
4. W. H. E. DAY, Computational complexity of inferring phytogenies from dissimilarity matrices, Bull. Math. Biol., 49 (1987), pp. 461-467.
5. W. F. DE LA VEGA AND C KENYON, A randomized approximation scheme for Metric MAXCUT, J. Comput. System Sci., 63 (2001), pp. 531-541.
6. I. S. DHILLON, S. SRA, AND J. A. TROPP, The Metric Nearness Problems with Applications, Tech. report TR-03-23, Computer Sciences, University of Texas at Austin, Austin, TX, 2003.
7. I. S. DHILLON, S. SRA, AND J. A. TROPP, Triangle fixing algorithms for the metric nearness problem, in Advances in Neural Information Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, eds., MIT Press, Cambridge, MA, 2005.
8. M. FARÁCH, S. KANNAN, AND T. WARNOW, A robust model for finding optimal evolutionary trees, Algorithmica, 13 (1995), pp. 155-179.
9. J.C. GOWER, Properties of Euclidean and non-Euclidean distance matrices, Linear Algebra Appl., 67 (1985), pp. 81-97.
10. N. J. HIGHAM, Matrix nearness problems and applications, in Applications of Matrix Theory, M. J. C. Gower and S. Barnett, eds., Oxford University Press, Oxford, 1989, pp. 1-27.
11. L. J. HUBERT, P. ARABIE, AND J. MEULMAN, The representation of symmetric proximity data: Dimensions and classifications, Computer J., 41 (1998), pp. 566-577.
12. P. INDYK, A sublinear-time approximation scheme for clustering in metric spaces, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, IEEE, 1999, pp. 154-159.
13. P. INDYK, Sublinear time algorithms for metric space problems, in Proceedings of the 31st Annual Symposium on Theory of Computing, ACM, 1999, pp. 428-434.
14. J. B. KRUSKAL AND M. WISH, Multidimensional Scaling, Quantitative Applications in the Social Sciences, Sage Publications, Newbury Park, CA, 1978.
15. J. LAUB AND K.-R. MÜLLER, Feature discovery in non-metric pairwise data, J. Mach. Learn. Res., 5 (2004), pp. 801-818.
16. D. G. LUENBERGER, Linear and Nonlinear Programming, 2nd ed., Kluwer Academic, Boston, MA, 1984.
17. O. L. MANGASARIAN, Normal solutions of linear programs, Math. Programming Stud., 22 (1984), pp. 206-216.
18. R. R. METTU AND C. G. PLAXTON, The online median problem, SIAM J. Comput., 32 (2003), pp. 816-832.
19. C. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Dover, Mineola, NY, 2000.
20. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
21. M. PARNAS AND D. RON, Testing metric properties, in Proceedings of the Annual Symposium on Theory of Computing, ACM, 2001, pp. 276-285.
22. C. G. PLAXTON, Personal communication, 2003-2004.
23. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
24. V. ROTH, J. LAUB, J. M. BUHMANN, AND K.-R. MÜLLER, Going metric: Denoising pairwise data, in Advances in Neural Information Processing Systems 15, S. Becker, S. Thrun, and K. Obermayer, eds., MIT Press, Cambridge, MA, 2003, pp. 841-848.
25. V. ROTH, J. LAUB, M. KAWANABE, AND J. M. BUHMANN, Optimal cluster preserving embedding of nonmetric proximity data, IEEE Trans. Pattern Anal. Machine Intelligence, 25 (2003), pp. 1540-1551.
26. I. J. SCHOENBERG, Remarks to Maurice Frécheťs article "Sur la definition axiomatique d'une classe d'espace distanciés vectoriellement applicable sur l'espace de Hubert," Ann. of Math., 36 (1935), pp. 724-732.
27. P. TSENG, Dual coordinate ascent methods for nonstrictly convex minimization, Math. Programming, 59 (1993), pp. 231-247.
28. E. P. XING, A. Y. NG, M. I. JORDAN, AND S. RUSSELL, Distance metric learning, with application to clustering with side constraints, in Advances in Neural Information Processing Systems 15, S. Becker, S. Thrun, and K. Obermayer, eds., MIT Press, Cambridge, MA, 2003, pp. 521-528.