Metric Comparisons of Relations
Kenneth P. Ewing, Michael Robinson

TL;DR
This paper introduces a new pseudometric for binary relations that quantifies consensus, providing bounds and an efficient algorithm, with applications demonstrated in data analysis and file format consensus.
Contribution
It presents a novel pseudometric for relations, a functor-based interpretation, and an efficient bounding algorithm applicable in data analysis.
Findings
Pseudometric measures consensus among relation subsets.
Bound can be computed without exhaustive search.
Algorithm complexity is proportional to the product of relation dimensions.
Abstract
This paper defines a new pseudometric for binary relations between finite sets that measures consensus among subsets. The main results are (1) a concise restatement of this pseudometric with an intuitively appealing interpretation via a full and faithful functor from the category of relations to a category of relation multisets and (2) that the pseudometric can be bounded without an expensive search of possible mappings, based solely on the dimensions of the relations themselves. Additionally, (3) an algorithm is described to calculate this bound with time and memory complexity at worst proportional to the product of those dimensions: . The tools developed in this paper should find broad application in exploratory data analysis. We provide one such application by briefly exploring ad hoc consensus specifications for the well-known PDF file format.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Topological and Geometric Data Analysis · Data Management and Algorithms
