Experimental comparison of heuristic cluster-editing algorithms for entity deduplication.
Summary
The application of heuristic weighted cluster-editing algorithms within the scope
of entity deduplication is a relatively unexplored area. This research has aimed
at comparing the efficacy of different heuristics on both real-world and artificiallygenerated entity-deduplication data-sets. The research has shown that the
Force, Spectral, Vote/BOEM, and Split-Merge heuristics perform relatively well
for precision in comparison to the benchmark heuristics Pivot and Closure on
a variety of data-sets
Collections
Related items
Showing items related by title, author, creator and subject.
-
Matrix Partitioning: Optimal bipartitioning and heuristic solutions.
Pelt, D.M. (2011)An important component of many scientific computations is the matrix-vector multiplication. An efficient parallelization of the matrix-vector multiplication would instantly lower computation times in many areas of scientific ... -
Nurse rostering through linear programming and repair heuristics
Weelden, T. van (2013)We consider a nurse scheduling problem in a large hospital in the center of The Netherlands. Approximately 50 nurses with different qualifications should obtain a work schedule for a period of 6 weeks. Every day is divided ... -
Automated model specification search in CFA using meta-heuristics
Kromhof, Oscar (2023)[""Confirmatory Factor Analysis is an essential tool in psychometrics to indirectly measure abstract psychological constructs. It is therefore important to have a well fitting CFA model on empirical data-sets. It turns out ...