shortest path edit distance for detecting duplicate biological entities
This paper presents a novel and context-sensitive Shortest Path Edit Distance (SPED) applied to duplicate entity detection in biological data. SPED is an extension of Markov Random Field-based Edit Distance. It transforms the edit distance computational problem to the calculation of the shortest path among two selected vertices of a graph. The experimental results show that SPED produces competitive outcomes. SoftSPED, the combination of SPED with TFIDF, achieves superior performance in most cases.
edit distance biological entities duplicate detection algorithm