Supervised Record Coreference Resolution Algorithm

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):
  • a Supervised Person Record Coreference Resolution Algorithm.
  • a Supervised Citation Record Coreference Resolution Algorithm.
  • a Supervised Product Record Coreference Resolution Algorithm.
  • …
• Counter-Example(s):
  • an Unsupervised Record Coreference Resolution Algorithm.
  • an Supervised Entity Mention Coreference Resolution Algorithm.
• 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).

---