A Genetic Programming Approach to Record Deduplication

Several systems that rely on consistent data to offer high-quality services, such as digital libraries and e-commerce brokers, may be affected by the existence of duplicates, quasi replicas, or near-duplicate entries in their repositories. Because of that, there have been significant investments fro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on knowledge and data engineering Ročník 24; číslo 3; s. 399 - 412
Hlavní autori: de Carvalho, M. G., Laender, A. H. F., Goncalves, M. A., da Silva, A. S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.03.2012
Predmet:
Data mining
Database administration
database integration
evolutionary computing and genetic algorithms
Genetic programming
Machine learning
Probabilistic logic
Training
ISSN:1041-4347
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Several systems that rely on consistent data to offer high-quality services, such as digital libraries and e-commerce brokers, may be affected by the existence of duplicates, quasi replicas, or near-duplicate entries in their repositories. Because of that, there have been significant investments from private and government organizations for developing methods for removing replicas from its data repositories. This is due to the fact that clean and replica-free repositories not only allow the retrieval of higher quality information but also lead to more concise data and to potential savings in computational time and resources to process this data. In this paper, we propose a genetic programming approach to record deduplication that combines several different pieces of evidence extracted from the data content to find a deduplication function that is able to identify whether two entries in a repository are replicas or not. As shown by our experiments, our approach outperforms an existing state-of-the-art method found in the literature. Moreover, the suggested functions are computationally less demanding since they use fewer evidence. In addition, our genetic programming approach is capable of automatically adapting these functions to a given fixed replica identification boundary, freeing the user from the burden of having to choose and tune this parameter.
ISSN:1041-4347
DOI:10.1109/TKDE.2010.234