A note on the triangle inequality for the Jaccard distance
Two simple proofs of the triangle inequality for the Jaccard distance in terms of nonnegative, monotone, submodular functions are given and discussed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Metric Dimension and Resolvability of Jaccard Spaces
A subset of points in a metric space is said to resolve it if each point in the space is uniquely characterized by its distance to each point in the subset. In particular, resolving sets can be used to represent points i…
Measuring Distance Between Unordered Sets of Different Sizes
We present a distance metric based upon the notion of minimum-cost injective mappings between sets. Our function satisfies metric properties as long as the cost of the minimum mappings is derived from a semimetric, for w…
Information RetrievalRetrievalAn Inductive Bias for Distances: Neural Nets that Respect the Triangle Inequality
Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequalit…
Inductive BiasMetric LearningMulti-Goal Reinforcement Learningreinforcement-learning+2A Triangle Inequality for Cosine Similarity
Similarity search is a fundamental problem for many data analysis techniques. Many efficient search techniques rely on the triangle inequality of metrics, which allows pruning parts of the search space based on transitiv…
Sign-Aware Multistate Jaccard Kernels and Geometry for Real and Complex-Valued Signals
We introduce a sign-aware, multistate Jaccard/Tanimoto framework that extends overlap-based distances from nonnegative vectors and measures to arbitrary real- and complex-valued signals while retaining bounded metric and…
Feature Engineering