# Item

ITEM ACTIONSEXPORT

Released

Journal Article

#### The Metric Nearness Problem

##### External Ressource

https://epubs.siam.org/doi/10.1137/060653391

(Publisher version)

##### Fulltext (public)

There are no public fulltexts stored in PuRe

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Brickell, J., Dhillon, I., Sra, S., & Tropp, J. (2008). The Metric Nearness Problem.* SIAM journal on matrix analysis and applications,* *30*(1),
375-396. doi:10.1137/060653391.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-C9D5-C

##### Abstract

Metric nearness refers to the problem of optimally restoring metric properties to distance measurements that happen to be nonmetric due to measurement errors or otherwise. Metric data can be important in various settings, for example, in clustering, classification, metric-based indexing, query processing, and graph theoretic approximation algorithms. This paper formulates and solves the metric nearness problem: Given a set of pairwise dissimilarities, find a nearest set of distances that satisfy the properties of a metricprincipally the triangle inequality. For solving this problem, the paper develops efficient triangle fixing algorithms that are based on an iterative projection method. An intriguing aspect of the metric nearness problem is that a special case turns out to be equivalent to the all pairs shortest paths problem. The paper exploits this equivalence and develops a new algorithm for the latter problem using a primal-dual method. Applications to graph clustering are provided as an illustratio
n. We include experiments that demonstrate the computational superiority of triangle fixing over general purpose convex programming software. Finally, we conclude by suggesting various useful extensions and generalizations to metric nearness.