Knowledge-based entity resolution with contextual information defined over a monoid
|K. Schewe, Q. Wang, M. Rady. Knowledge-based entity resolution with contextual information defined over a monoid. volume 9344, pages 128-135, 9, 2015.|
|Buch||Model and Data Engineering - Proc. MEDI 2015|
|Serie||Lecture Notes of Computer Science|
Entity resolution (aka record linkage) addresses the problem to decide whether two entity representations in a database or stream correspond to the same real-world object. Knowledge-based entity resolution is grounded in knowledge patterns, which combine rules defined by Horn clauses with conditions prescribing when the rule is applicable, and conditions specifying when the application of the rule is not permitted. So far, these positive and negative conditions are expressed as bindings of the variables appearing in the Horn clause. In this paper the condition part of a knowledge pattern is generalised to a context, which is still defined by a positive and a negative part, but for both equations involving operators are permitted. The paper concentrates on conditions over a monoid for the constraints in a context. With this generalisation standard properties of knowledge patterns such as minimality, containment and optimality are investigated, which altogether minimise redundancy and thus optimise the inference of equivalences between entities.