Validation of Matching
We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms. The bounds require some verified matches, but those matches may be used to develop the algorithms. The bounds can be applied to network reconciliation or entity resolution algorithms, which identify nodes in different networks or values in a data set that correspond to the same entity. For network reconciliation, the bounds do not require knowledge of the network generation process.
Code (0)
등록된 구현이 없습니다.
Tasks
Entity ResolutionSimilar Papers 제목 키워드 기반
Cross-validation of matching correlation analysis by resampling matching weights
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and defin…
Dimensionality ReductionGraph EmbeddingVideo Object Segmentation With Dynamic Memory Networks and Adaptive Object Alignment
In this paper, we propose a novel solution for object-matching based semi-supervised video object segmentation, where the target object masks in the first frame are provided. Existing object-matching based methods fo…
ObjectSemantic SegmentationSemi-Supervised Video Object SegmentationVideo Object Segmentation+1Calibrated Dataset Condensation for Faster Hyperparameter Search
Dataset condensation can be used to reduce the computational cost of training multiple models on a large dataset by condensing the training dataset into a small synthetic set. State-of-the-art approaches rely on matching…
Dataset CondensationPMVOS: Pixel-Level Matching-Based Video Object Segmentation
Semi-supervised video object segmentation (VOS) aims to segment arbitrary target objects in video when the ground truth segmentation mask of the initial frame is provided. Due to this limitation of using prior knowledge …
ObjectOne-shot visual object segmentationSegmentationSemantic Segmentation+3Learning relationships between data obtained independently
The aim of this paper is to provide a new method for learning the relationships between data that have been obtained independently. Unlike existing methods like matching, the proposed technique does not require any conte…