Knowledge-Based entity resolution with contextual information defined over a monoid

Klaus Dieter Schewe; Qing Wang; Mariam Rady

doi:10.1007/978-3-319-23781-7_11

Knowledge-Based entity resolution with contextual information defined over a monoid

Klaus Dieter Schewe^*, Qing Wang, Mariam Rady

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings
Editors	Yannis Manolopoulos, Ladjel Bellatreche
Publisher	Springer Verlag
Pages	128-135
Number of pages	8
ISBN (Print)	9783319237800
DOIs	https://doi.org/10.1007/978-3-319-23781-7_11
Publication status	Published - 2015
Event	5th International Conference on Model and Data Engineering, MEDI 2015 - Rhodes, Greece Duration: 26 Sept 2015 → 28 Sept 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9344
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Conference on Model and Data Engineering, MEDI 2015
Country/Territory	Greece
City	Rhodes
Period	26/09/15 → 28/09/15

Access to Document

10.1007/978-3-319-23781-7_11

Cite this

Schewe, K. D., Wang, Q., & Rady, M. (2015). Knowledge-Based entity resolution with contextual information defined over a monoid. In Y. Manolopoulos, & L. Bellatreche (Eds.), Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings (pp. 128-135). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9344). Springer Verlag. https://doi.org/10.1007/978-3-319-23781-7_11

Schewe, Klaus Dieter ; Wang, Qing ; Rady, Mariam. / Knowledge-Based entity resolution with contextual information defined over a monoid. Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings. editor / Yannis Manolopoulos ; Ladjel Bellatreche. Springer Verlag, 2015. pp. 128-135 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{15b8567d24204f728f31b11098cdb29b,

title = "Knowledge-Based entity resolution with contextual information defined over a monoid",

abstract = "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.",

author = "Schewe, {Klaus Dieter} and Qing Wang and Mariam Rady",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 5th International Conference on Model and Data Engineering, MEDI 2015 ; Conference date: 26-09-2015 Through 28-09-2015",

year = "2015",

doi = "10.1007/978-3-319-23781-7_11",

language = "English",

isbn = "9783319237800",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "128--135",

editor = "Yannis Manolopoulos and Ladjel Bellatreche",

booktitle = "Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings",

address = "Germany",

}

Schewe, KD, Wang, Q & Rady, M 2015, Knowledge-Based entity resolution with contextual information defined over a monoid. in Y Manolopoulos & L Bellatreche (eds), Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9344, Springer Verlag, pp. 128-135, 5th International Conference on Model and Data Engineering, MEDI 2015, Rhodes, Greece, 26/09/15. https://doi.org/10.1007/978-3-319-23781-7_11

Knowledge-Based entity resolution with contextual information defined over a monoid. / Schewe, Klaus Dieter; Wang, Qing; Rady, Mariam.
Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings. ed. / Yannis Manolopoulos; Ladjel Bellatreche. Springer Verlag, 2015. p. 128-135 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9344).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Knowledge-Based entity resolution with contextual information defined over a monoid

AU - Schewe, Klaus Dieter

AU - Wang, Qing

AU - Rady, Mariam

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84951834287&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23781-7_11

DO - 10.1007/978-3-319-23781-7_11

M3 - Conference contribution

AN - SCOPUS:84951834287

SN - 9783319237800

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 128

EP - 135

BT - Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings

A2 - Manolopoulos, Yannis

A2 - Bellatreche, Ladjel

PB - Springer Verlag

T2 - 5th International Conference on Model and Data Engineering, MEDI 2015

Y2 - 26 September 2015 through 28 September 2015

ER -

Schewe KD, Wang Q, Rady M. Knowledge-Based entity resolution with contextual information defined over a monoid. In Manolopoulos Y, Bellatreche L, editors, Model and Data Engineering - 5th International Conference, MEDI 2015, Proceedings. Springer Verlag. 2015. p. 128-135. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-23781-7_11

Knowledge-Based entity resolution with contextual information defined over a monoid

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this