Entity Matching Debugging Experiments on Six Real-World Datasets

A research paper and associated experiments focus on optimizing interactive debugging cycles for rule-based entity matching. The work, by Fatemah Panahi of the University of Wisconsin–Madison, proposes techniques like 'early exit' and 'dynamic memoing' to reduce computation time. Experiments validating the approach were conducted on six real-world data sets.

Use Cases

• Benchmarking rule-ordering optimization algorithms based on the described cost model.
• Developing interactive debugging tools for entity matching based on the proposed 'early exit' and 'dynamic memoing' techniques.
• Studying performance improvements for incremental rule changes in matching systems.
• Evaluating matching functions structured as conjunctive normal form (CNF) rules on real-world data.

Strengths

• Experiments were conducted on six real-world data sets, suggesting practical validation.
• The description details specific optimization techniques ('early exit', 'dynamic memoing') and a formal cost model.

Limitations

• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Last update date is unknown; freshness unverified.

Provenance

Source

University of Wisconsin–Madison

Collection Method

Research paper and experiments

Time Range

unknown

Freshness

unknown

Geography

unknown