Record linkage, a part of data cleaning, is recognized as one of most expensive steps in data warehousing. Most record linkage (RL) systems employ a strategy of using blocking filters to reduce the number of pairs to be matched. A blocking filter consists of a number of blocking criteria. Until recently, blocking criteria are selected manually by domain experts. This paper proposes a new method...

We study a game played on a graph by two players, named Maximizer and Minimizer. Each round two new vertices are chosen; first Maximizer chooses a vertex u that has at least one unchosen neighbor and then Minimizer chooses a neighbor of u. This process eventually produces a maximal matching of the graph. Maximizer tries to maximize the number of edges chosen, while Minimizer tries to minimize i...

Enterprise schemas tend to be different, which is the key issue when the seamless communication between systems is of utmost importance. One solution could be the development of standards which then could be enforced, however, vendors seem to be reluctant to comply with them and communication between existing and legacy systems still remains unsolved. Other solution could be schema matching, wh...

We address the problem of automating the process of deciding whether two data schema elements match (that is, refer to the same actual object or concept), and propose several methods for combining evidence computed by multiple basic matchers. One class of methods uses Bayesian networks to account for the conditional dependency between the similarity values produced by individual matchers that u...

We examined how the intrinsic orientation of spatial layouts and the conversational partner’s viewpoint shape how people organize spatial information in memory and subsequently describe it. In 24 pairs, Directors first studied an array with a symmetrical structure while either knowing their Matcher’s subsequent viewpoint or not. When describing the array to the Matcher, the array’s intrinsic or...

String matching plays an important role in biomedical Term Normalisation, the task of linking mentions of biomedical entities to identifiers in reference databases. This paper evaluates exact, rule-based and various string-similarity-based matching techniques. The matchers are compared in two ways: first, we measure precision and recall against a gold-standard dataset and second, we integrate t...

Currently biometric system performance is evaluated in terms of its FAR and FRR. The accuracy expressed in such a manner depends on the characteristics of the dataset on which the system has been tested. Using different datasets for system evaluation makes a true comparison of such systems difficult, more so in cases where the systems are designed to work on different biometrics, such as finger...

A perennial problem in recovering 3-D models from images is repeated structures common in modern cities. The problem can be traced to the feature matcher which needs to match less distinctive features (permitting wide-baselines and avoiding broken sequences), while simultaneously avoiding incorrect matching of ambiguous repeated features. To meet this need, we develop RepMatch, an epipolar guid...

Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, several tools have enabled the use of schema matcher ensembles, combining principles by which different schema matchers judge the similarity between concepts. In this work, we investigate means of estimating the uncertai...