Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

An algorithm for the parallel construction of k-connectivity certificates for graphs, Scan-First Search, was introduced by Joseph Cheriyan, Ming-Yang Kao, and Ramakrishna Thurimella in their paper Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for KVertex Connectivity.[2] The following is an attempt to clarify and simplify the concepts and proofs presented in that paper.

Abstract The purpose of the paper is to provide a general method based on conditional quantile curves predict record values from preceding records. predictions are median (or regression) curves. Moreover, quantiles used confidence bands for these predictions. recently introduced concept multivariate distorted distributions that instead copulas represent dependence structure. This allows us comp...