Entity Resolution with Weighted Constraints
Constraints ubiquitously exist in many real-life applications for entity resolution (ER). However, it is always challenging to effectively specify and efficiently use constraints when performing ER tasks. In particular, not every constraint is equally effective or robust, and using weights to express the “confidences” on constraints becomes a natural choice. In this paper, we study entity resolution (ER) (i.e., the problem of determining which records in a database refer to the same entities)...[Show more]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (LNCS)|
|01_Shen_Entity_Resolution_with_2014.pdf||301.44 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.