Relational Record Linkage Algorithm
(Redirected from Relational Record Coreference Resolution Algorithm)
Jump to navigation
Jump to search
A Relational Record Linkage Algorithm is a coreferent record resolution algorithm that applies a relational learning algorithm.
- AKA: Relational Coreferent Record Resolution Algorithm.
- Context:
- It can be applied by a Relational Record Linkage System (that can solve a Relational Record Linkage Task). Ontology Concept Coreference Resolution Task.
- …
- Counter-Example(s):
- See: Graph Record Linkage Algorithm.
References
2007
- (Bhattacharya and Getoor, 2007) ⇒ Indrajit Bhattacharya, and Lise Getoor. (2007). “Collective Entity Resolution in Relational Data.” In: Proceedings for ACM Transactions on Knowledge Discovery from Data (TKDD 2007).
2004
- (Giunchiglia et al., 2004) ⇒ Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskevich. (2004). “Smatch: An algorithm and an implementation of semantic matching.” In: Proceedings of the First European Semantic Web Symposium (ESWS 2004).