TY - GEN
T1 - Shortest Path Edit Distance for detecting duplicate biological entities
AU - Rudniy, Alex
AU - Song, Min
AU - Geller, James
PY - 2010
Y1 - 2010
N2 - 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. Soft-SPED, the combination of SPED with TFIDF, achieves superior performance in most cases.
AB - 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. Soft-SPED, the combination of SPED with TFIDF, achieves superior performance in most cases.
UR - http://www.scopus.com/inward/record.url?scp=77958028272&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77958028272&partnerID=8YFLogxK
U2 - 10.1145/1854776.1854851
DO - 10.1145/1854776.1854851
M3 - Conference contribution
AN - SCOPUS:77958028272
SN - 9781450304382
T3 - 2010 ACM International Conference on Bioinformatics and Computational Biology, ACM-BCB 2010
SP - 442
EP - 444
BT - 2010 ACM International Conference on Bioinformatics and Computational Biology, ACM-BCB 2010
T2 - 2010 ACM International Conference on Bioinformatics and Computational Biology, ACM-BCB 2010
Y2 - 2 August 2010 through 4 August 2010
ER -