Motivated by several applications, we introduce various distance measures between k lists. Some of these distance measures are metrics, while others are not. For each of these latter distance measures: we show that it is a metric in the following two seemingly unrelated aspects:step-(i) it satisfies a relaxed version of the polygonal (hence, triangle) inequality, andstep-(ii) there is a metric with positive constant multiples that bounds our measure above and below.This is not a coincidence---we show that these two notions of almost being a metric are the same. Based on the second notion, we define two distance measures to be equivalent if they are bounded above and below by constant multiples of each other. We thereby identify a large and robust equivalence class of distance measures.Besides the applications to the task of identifying good notions of (dis-)similarity between two top k lists, our results imply polynomial-time constant-factor approximation algorithms for the rank aggregation problem with respect to a large class of distance measures.
Let k be a fixed integer. We consider the problem of partitioning an input set of points endowed with a distance function into k clusters. We give polynomial time approximation ...
The shape-space ∑ m k whose points σ represent the shapes of not totally degenerate k-ads in Rm is introduced as a quotient space carrying the quotient metric. When m = 1, we fi...
Semantic Textual Similarity (STS) measures the degree of semantic equivalence between two texts. This paper presents the results of the STS pilot task in Semeval. The training d...
In this work we focus on entanglement of two--mode Gaussian states of continuous variable systems. We first review the formalism of Gaussian measures of entanglement, adopting t...
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by th...
Social media, news, blog, policy document mentions