Relational Similarity Function
From GM-RKB
Jump to navigation
Jump to search
A Relational Similarity Function is a Similarity Function that traverses a Data Records Relations.
- Context:
- It can be used by a Duplicate Record Detection Algorithm, for example on the Citation Duplicate Record Detection Task.
- See: Relational Learning 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).
2005
- (Kalashnikov et al., 2005) ⇒ Dmitri V. Kalashnikov, Sharad Mehrotra, and Zhaoqi Chen. (2005). "Exploiting Relationships for Domain-Independent Data Cleaning." In: Proceedings of the SIAM International Conference on Data Mining (SIAM SDM 2005)
2001
- (Luo & Hancock, 2001) ⇒ Bin Luo and Edwin R. Hancock. (2001). "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition." In: IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10).