Approximate classification via earthmover metrics

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1072-1080

  Archer, Aaron ^a   Fakcharoenphol, Jittat ^b   Harrelson, Chris ^c   Krauthgamer, Robert ^d   Talwar, Kunal ^c   Tardos, Éva ^e  

^a Department of Obstetrics Gynecology   (United States)

^b KASETSART UNIVERSITY   (Thailand)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

EARTHMOVER METRICS; TERMINAL METRICS;

APPROXIMATION THEORY; COMPUTER VISION; COSTS; INFORMATION ANALYSIS; INTEGRAL EQUATIONS; LINEAR PROGRAMMING; MARKOV PROCESSES; METRIC SYSTEM; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

PROBABILITY DISTRIBUTIONS;

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

References (25)

1. [AP90] B. Awerbuch and D. Peleg. Sparse partitions. In 31st Annual IEEE Symposium on Foundations of Computer Science, pages 503-513, 1990.
2. [Bar98] Y. Bartal. On approximating arbitrary metrics by tree metrics. In 30th Annual ACM Symposium on Theory of Computing, pages 161-168. ACM, 1998.
3. [BVZ98] Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In 7th IEEE International Conference on Computer Vision, pages 377-384, 1998.
4. [BVZ01] Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis & Machine Intelligence, 23(11):1222-1239, Nov. 2001.
5. +98] M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In 39th Annual Symposium on Foundations of Computer Science, pages 379-388, 1998.
6. [Cha00] M. Charikar. Personal communication, January 2000.
7. [CKNZ01] C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 109-118, 2001.
8. [CKR00] G. Calinescu, H. J. Karloff, and Y. Rabani. An improved approximation algorithm for multiway cut. JCSS, 60(3):564-574, 2000.
9. [CKR01] G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001.
10. +94] E. Dahlnaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23(4):864-894, 1994.
11. [FH00] P. F. Felzenszwalb and D. P. Huttenlocher. Efficient matching of pictorial structures. In IEEE Computer Vision and Pattern Recognition Conference, pages 66-73, 2000.
12. [FHRT03] J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 257-265, 2003.
13. [FRT03] J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
14. [FT03] J. Fakcharoenphol and K. Talwar. Improved decompositions of graphs with forbidden minors. In 6th International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 36-46, 2003.
15. [GT00] A. Gupta and É. Tardos. A constant factor approximation algorithm for a class of classification algorithms. In 32nd Annual ACM Symposium on Theory of Computing, pages 652-658, 2000.
16. [Gup01] A. Gupta. Steiner points in tree metrics don't (really) help. In 12th Annual ACM-SIAMSymposium on Discrete Algorithms, pages 220-227, 2001.
17. [IG98] H. Ishikawa and D. Geiger. Segmentation by grouping junctions. In IEEE Conference on Computer Vision and Pattern Recognition, 1998.
18. [Kar98] A. Karzanov. Minimum 0-extensions of graph metrics. European Journal of Combinatorics, 19(1):71-101, 1998.
19. +99] D. R. Karger, P. Klein, C. Stein, M. Thorup, and N. E. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. In 31st Annual ACM Symposium on Theory of Computing, pages 668-678, 1999.
20. [KPR93] P. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In 25th Annual ACM Symposium on Theory of Computing, pages 682-690, May 1993.
21. [KT02] J. M. Kleinberg and É. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. Journal of the Association for Computing Machinery, 49:616-639, 2002.
22. [LN03] J. R. Lee and A. Naor. Metric decomposition, smooth measures, and clustering, 2003. Submitted.
23. [LR99] F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM, 46(6):787-832, 1999.
24. [LS93] N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441-454, 1993.
25. [Vaz01] V. V. Vazirani. Approximation Algorithms. Springer-Verlag, New York, 2001.