Supervised Record Coreference Resolution Algorithm
(Redirected from Supervised Record Linkage Algorithm)
Jump to navigation
Jump to search
A Supervised Record Coreference Resolution Algorithm is a Data-Driven Record Coreference Resolution Algorithm that applies a Supervised Learning Algorithm to solve a Supervised Record Coreference Resolution Task.
- AKA: Supervised Record-Linkage Algorithm.
- Context:
- It can range from being Fully-Supervised Record Coreference Resolution Algorithm to being a Semi-Supervised Record Coreference Resolution Algorithm.
- It can be applied by a Supervised Record Coreference Resolution System (to solve a Supervised Record Coreference Resolution Task).
- It can range from being an Supervised Intra-Database Record Coreference Resolution Algorithm to being a Supervised Inter-Database Record Coreference Resolution Algorithm.
- Example(s):
- Counter-Example(s):
- See: Coreference Resolution Algorithm.
References
2007
- (Bhattacharya & 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).
- (Elmagarmid et al., 2007) ⇒ Ahmed K. Elmagarmid, Panagiotis G. Ipeirotis, and Vassilios S. Verykios (2007). “Duplicate Record Detection: A Survey." IEEE Transactions on Knowledge and Data Engineering 19 (1).