Detecting duplicate biological entities using shortest path edit distance

International Journal of Data Mining and Bioinformatics

Volumn 4, Issue 4, 2010, Pages 395-410

  Rudniy, Alex ^a   Song, Min ^b   Geller, James ^a  

^a New Jersey Institute of Technology   (United States)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Biological entity matching; Duplicate record detection; Histogram matching; Levenshtein; Shortest path edit distance; SPED; Text mining

Indexed keywords

ALGORITHM; AUTOMATED PATTERN RECOGNITION; BIOLOGY; COMPARATIVE STUDY; DATA MINING; PROCEDURES;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATA MINING; PATTERN RECOGNITION, AUTOMATED;

EID: 77954714476     PISSN: 17485673     EISSN: 17485681     Source Type: Journal    
DOI: 10.1504/IJDMB.2010.034196     Document Type: Article

References (36)

1. Bellman, R. (1958) 'On a routing problem', Quarterly of Applied Mathematics, Vol. 16, No. 1, pp. 87-90.
2. Benson, D. A., Karsch-Mizrachi, I., Lipman, D. J., Ostell, J. and Wheeler, D. L. (2008) 'GenBank', Nucleic Acids Res., Vol. 36, Database issue, pp. D25-D30.
3. Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P. and Fienberg, S. (2003) 'Adaptive name matching in information integration', IEEE Intelligent System, Vol. 18, No. 5, pp. 16-23.
4. Camon, E. B., Barrell, D., Dimmer, E. C., Lee, V., Magrane, M., Maslen, J., Binns, D. and Apweiler, R. (2005) 'An evaluation of GO annotation retrieval for BioCreATivE and GOA', BMC Bioinformatics, Vol. 6, Suppl., p. S17.
5. Cochrane, G., Akhtar, R., Bonfield, J., Bower, L., Demiralp, F., Faruque, N., Gibson, R., Hoad, G., Hubbard, T., Hunter, C., Jang, M., Juhos, S., Leinonen, R., Leonard, S., Lin, Q., Lopez, R., Lorenc, D., McWilliam, H., Mukherjee, G., Plaister, S., Radhakrishnan, R., Robinson, S., Sobhany, S., Hoopen, P. T., Vaughan, R., Zalunin, V. and Birney, E. (2009) 'Petabyte-scale innovations at the European nucleotide archive', Nucleic Acids Research, Vol. 37, Database issue, pp. D19-D25.
6. Cohen, W. W., Ravikumar, P. and Fienberg, S. E. (2003) 'A comparison of string distance metrics for name-matching tasks', Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), Acapulco, Mexico, pp. 73-78.
7. Culotta, A. and McCallum, A. (2005a) 'Joint deduplication of multiple record types in relational data', Proceedings of the 14th ACM International Conference on Information and Knowledge Management, 31 October - 05 November, Bremen, Germany, pp. 257-258.
8. Culotta, A. and McCallum, A. (2005b) Practical Markov Logic Containing First-order Quantifiers with Application to Identity Uncertainty, Technical Report IR-430, University of Massachusetts, September.
9. Denardo, D. E. (2003) Dynamic Programming Models and Applications, Dover, New York.
10. Dijkstra, E. W. (1959) 'A note on two problems in connection with graphs', Numer. Math., Vol. 1, pp. 269-271.
11. Elmagarmid, A. K., Ipeirotis, P. G. and Verykios, V. S. (2007) 'Duplicate record detection: a survey', The IEEE Transations on knowledge and Data Engineering (TKDE), Vol. 19, No. 1, January, pp. 1-16.
12. Fellegi, I. P. and Sunter, A. B. (1969) 'A theory for record linkage', Journal of the American Statistical Society, Vol. 64, pp. 1183-1210.
13. Floyd, R. W. (1962) 'Algorithm 97: shortest path', CACM, Vol. 5, p. 345.
14. Ford Jr., L. R. and Fulkerson, D. R. (1962) Flows in Networks, Princeton University Press, Princeton.
15. Geman, S. and Geman, D. (1984) 'Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images', IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 6, No. 6, pp. 721-741.
16. GenBank (2009) GenBank Statistics, Obtained through the internet, http://www.ncbi.nlm.nih.gov/Genbank/genbankstats.html [accessed 01/03/2009].
17. GOA (2008) Gene Ontology Annotation - Proteomes, European Bioinformatics Institute, Obtained through the internet, http://www.ebi.ac.uk/GOA/proteomes. html [accessed 10/12/2008].
18. Gotoh, O. (1982) 'An improved algorithm for matching biological sequences', J. Mol. Biol., Vol. 162, pp. 705-708.
19. Levenshtein, V. I. (1966) 'Binary codes capable of correcting deletions, insertions and reversals', Sov. Phys, Dokl., Vol. 10, February, pp. 707-710.
20. Li, S. Z. (1995) Markov Random Field Modeling in Computer Vision, Springer-Verlag, London.
21. Lowrance, R. and Wagner, R. (1975) 'An extension to string-to-string correction problem', Journal of ACM, Vol. 23, No. 2, pp. 177-183.
22. Monge, A. E. and Elkan, C. P. (1996) 'The field matching problem: algorithm and applications', Proceedings of ACM SIGKDD, Portland, pp. 267-270.
23. Monge, A. E. and Elkan, C. P. (1997) 'An efficient domain independent algorithm for detecting approximately duplicate database records', Proceedings of the SIGMOD 1997 Workshop on Data Mining and Knowledge Discovery, Tuscon, AZ, USA, pp. 23-29.
24. Needleman, S. B. and Wunsch, C. D. (1970) 'A general method applicable to the search for similarities in the amino acid sequence of two proteins', J. Mol. Biol., Vol. 48, pp. 443-453.
25. Pasula, H., Marthi, B., Milch, B., Russell, S. and Shpitser, I. (2002) 'Identity uncertainty and citation matching', Proceedings of Neural Information Processing System (NIPS) 15: Natural and Synthetic, Whistler, BC, Canada, pp. 1401-1408.
26. Ristad, E. and Yianilos, P. (1998) 'Learning string edit distance', IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20, No. 5, pp. 522-532.
27. Seni, G., Kripasundar, V. and Srihari, R. (1996) 'Generalizing edit distance to incorporate domain information: handwritten text recognition as a case study', Pattern Recognition, Vol. 29, No. 3, pp. 405-414.
28. Singla, P. and Domingos, P. (2004) 'Multi-relational record linkage', Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining, Seattle, WA, USA, pp. 31-48.
29. Singla, P. and Domingos, P. (2005) 'Learning the structure of markov logic networks', Proceedings of the Twenty-Second International Conference on Machine Learning, Bonn, Germany, pp. 441-448. (Pubitemid 43183364)
30. Singla, P. and Domingos, P. (2006) 'Entity resolution with markov logic', Proceedings of the Sixth International Conference on Data Mining, Hong Kong, China, pp. 572-582.
31. Sniedovich, M. (1992) Dynamic Programming, Marcel Dekker, New York.
32. Song, M. and Rudniy, A. (2008) 'Markov random field-based edit distance for entity matching', International Conference on Bioinformatics and Biomedicine, Philadelphia, PA, USA, pp. 457-460.
33. Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R. and Wu, C. H. (2007) 'UniRef: comprehensive and non-redundant uniprot reference clusters', Bioinformatics, Vol. 23, pp. 1282-1288.
34. Wagner, R. and Fischer, M. (1974) 'The string to string correction problem', Journal of the Association for Computing Machinery, Vol. 21, No. 1, pp. 168-173.
35. Wei, J. (2004) 'Markov edit distance', IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 26, No. 3, pp. 311-321.
36. Winkler, W. E. (1999) The State of Record Linkage and Current Research Problems, Obtained through the internet, http://www.census.gov/srd/papers/pdf/ rr99-04.pdf [accessed 10/2/2009].