Supporting Temporal Queries on XML Keyword Search Engines

Abstract

Recently, machine learning techniques have been used to solve the record deduplication problem.However, these techniques require examples, manually generated in most cases, for training purposes.This uneases the use of such techniques because of the cost required to create the set of examples.In this article, we propose an approach based on a deterministic technique to automatically suggest training examples for a deduplication method based on genetic programming.Our experiments with synthetic datasets show that, by using only 15% of the examples suggested by our approach, it is possible to achieve results in terms of F1 that are equivalent to those obtained when using all the examples, leading to savings in training time of up to 85%.