Pair-Matching: Links Prediction with Adaptive Queries

arXiv:1905.07342v3 Announce Type: replace-cross
Abstract: The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, represent the good matches. The algorithm queries pairs of nodes and observes the presence/absence of edges. Its goal is to discover as many edges as possible with a fixed budget of queries. Pair-matching is a particular …

abstract algorithm applications arxiv cs.lg good graph math.st nodes prediction queries set stat.ml stat.th the algorithm type