The Kantorovich Metric in Computer Science: A Brief Survey

Electronic Notes in Theoretical Computer Science

Volumn 253, Issue 3, 2009, Pages 73-82

  Deng, Yuxin ^a   Du, Wenjie ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b SHANGHAI NORMAL UNIVERSITY   (China)

Author keywords

bioinformatics; information retrieval; Kantorovich metric; probabilistic concurrency

Indexed keywords

KANTOROVICH METRIC; MATHEMATICAL TOOLS; PROBABILISTIC CONCURRENCY;

COMPUTER SCIENCE; IMAGE RETRIEVAL; INFORMATION SERVICES; METRIC SYSTEM; SURVEYS;

BIOINFORMATICS;

EID: 70349978533     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.10.006     Document Type: Article

References (37)

1. Baier C., Engelen B., and Majster-Cederbaum M.E. Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences 60 1 (2000) 187-231
2. Chaudhuri P., and Das S. Statistical analysis of large DNA sequences using distribution of DNA words. Current Science 80 9 (2001) 1161-1166
3. Chen K., Demko S., and Xie R. Similarity-based retrieval of images using color histograms. Storage and Retrieval for Image and Video Databases VII. SPIE volume 3656 (1999) 643-652
4. Deng Y., Chothia T., Palamidessi C., and Pang J. Metrics for action-labelled quantitative transition systems. Electronic Notes in Theoretical Computer Science 153 2 (2006) 79-96
5. Deng Y., and Du W. Probabilistic barbed congruence. Electronic Notes in Theoretical Computer Science 190 3 (2007) 185-203
6. Deng Y., van Glabbeek R., Hennessy M., and Morgan C. Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science 4 4:4 (2008) 1-33
7. Deng Y., van Glabbeek R., Hennessy M., Morgan C., and Zhang C. Characterising testing preorders for finite probabilistic processes. Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007), IEEE Computer Society 313-325
8. Desharnais J., Jagadeesan R., Gupta V., and Panangaden P. Metrics for labeled Markov systems. Proceedings of the 10th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 1664 (1999), Springer-Verlag 258-273
9. Desharnais J., Jagadeesan R., Gupta V., and Panangaden P. The metric analogue of weak bisimulation for probabilistic processes. Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002), IEEE Computer Society 413-422
10. Desharnais J., Jagadeesan R., Gupta V., and Panangaden P. Metrics for labelled Markov processes. Theoretical Computer Science 318 3 (2004) 323-354
11. Ferns N., Panangaden P., and Precup D. Metrics for finite Markov decision processes. Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence (2004), AUAI Press 162-169
12. Ferns N., Panangaden P., and Precup D. Metrics for Markov decision processes with infinite state spaces. Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (2005), AUAI Press 201-208
13. Gibbs A.L., and Su F.E. On choosing and bounding probability metrics. International Statistical Review 70 3 (2002) 419-435
14. Grana C., Borghesani D., and Cucchiara R. Video shots comparison using the Mallows distance. Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007), IEEE Computer Society 49-53
15. Jonsson B., and Larsen K. Specification and refinement of probabilistic processes. Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science (1991), Computer Society Press 266-277
16. Kantorovich L.V. On the translocation of masses. Doklady Akademii Nauk SSSR 37 7-8 (1942) 227-229
17. Kantorovich L.V., and Rubinshtein G.S. On a space of totally additive functions. Vestn Lening. Univ. 13 7 (1958) 52-59
18. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
19. E. Levina and P.J. Bickel. The Earth Mover's distance is the Mallows distance: Some insights from statistics. In Proceedings of the 8th International Conference On Computer Vision, volume 2, pages 251-256. IEEE Computer Society, 2001
20. X. Li and Y. Deng. Automatic measurement of large DNA sequences, 2009. In preparation
21. G. Monge. Mémoire sur la théorie des déblais et des remblais. Histoire de l'Academie des Science de Paris, page 666, 1781
22. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Proceedings of the 20th ACM Symposium on the Theory of Computing (1988), ACM 377-387
23. Puzicha J., Rubner Y., Tomasi C., and Buhmann J. Empirical evaluation of dissimilarity measures for color and texture. Proceedings of the 6th International Conference On Computer Vision (1999), IEEE Computer Society 1165-1173
24. Rachev S. Probability Metrics and the Stability of Stochastic Models (1991), Wiley, New York
25. Y. Rubner, C. Tomasi, and L. Guibas. The Earth Mover's distance as a metric for image retrieval. Technical Report STAN-CS-TN-98-86, Department of Computer Science, Stanford University, 1998
26. Rubner Y., Tomasi C., and Guibas L. A metric for distributions with applications to image databases. Proceedings of the 5th International Conference on Computer Vision (1998), IEEE Computer Society 59-66
27. van Breugel F., Hermida C., Makkai M., and Worrell J. An accessible approach to behavioural pseudometrics. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science volume 3580 (2005), Springer 1018-1030
28. van Breugel F., Hermida C., Makkai M., and Worrell J. Recursively defined metric spaces without contraction. Theoretical Computer Science 380 1-2 (2007) 143-163
29. van Breugel F., Sharma B., and Worrell J. Approximating a behavioural pseudometric without discount for probabilistic systems. Proceedings of the 10th International Conference on Foundations of Software Science and Computational Structures. Lecture Notes in Computer Science volume 4423 (2007), Springer 123-137
30. van Breugel F., and Worrell J. An algorithm for quantitative verification of probabilistic transition systems. Proceedings of the 12th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 2154 (2001), Springer-Verlag 336-350
31. van Breugel F., and Worrell J. Towards quantitative verification of probabilistic transition systems. Proceedings of the 28th International Colloquium Automata, Languages and Programming. Lecture Notes in Computer Science volume 2076 (2001), Springer-Verlag 421-432
32. van Breugel F., and Worrell J. A behavioural pseudometric for probabilistic transition systems. Theoretical Computer Science 331 1 (2005) 115-142
33. van Breugel F., and Worrell J. Approximating and computing behavioural distances in probabilistic transition systems. Theoretical Computer Science 360 1-3 (2006) 373-385
34. Vershik A. Kantorovich metric: Initial history and little-known applications. Journal of Mathematical Sciences 133 4 (2006) 1410-1417
35. Villani C. Topics in Optimal Transportation. Graduate Studies in Mathematics volume 58 (2003), American Mathematical Society
36. D. Zhou, J. Li, and H. Zha. A new Mallows distance based metric for comparing clusterings. In Proceedings of the Twenty-Second International Conference on Machine Learning, volume 119, pages 1028-1035. ACM, 2005
37. Życzkowski K., and Slomczyński W. The Monge distance between quantum states. Journal of Physics A: Mathematical and General 31 45 (1998) 9095-9104