Entity resolution in disjoint graphs: An application on genealogical data

Intelligent Data Analysis

Volumn 20, Issue 2, 2016, Pages 455-475

  Rahmani, Hossein ^a,b   Ranjbar Sahraei, Bijan ^b   Weiss, Gerhard ^b   Tuyls, Karl ^c  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Disjoint graphs; Entity resolution; Genealogy

Indexed keywords

CONTENT INFORMATION; CONTEXTUAL INFORMATION; DISJOINT GRAPHS; ENTITY RESOLUTIONS; GENEALOGY; INFORMATIVE PATTERNS; LINKAGE INFORMATION; NEW APPLICATIONS;

EID: 84960951012     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-160814     Document Type: Article

References (69)

1. H. B. Newcombe, J. M. Kennedy, S. J. Axford and A. P. James, Automatic linkage of vital records, Science 130 (1959), 954-959.
2. I. P. Fellegi and A. B. Sunter, A theory for record linkage, Journal of the American Statistical Association 64 (1969), 1183-1210.
3. W. Winkler, The state of record linkage and current research problems, 1999, URL: http://www. census. gov/srd/papers/ pdf/rr99-04. pdf.
4. I. Bhattacharya and L. Getoor, Iterative record linkage for cleaning and integration, in: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD '04, ACM, New York, NY, USA, (2004), 11-18. URL: http://doi. acm. org/10. 1145/1008694. 1008697. doi: 101145/1008694. 1008697.
5. P. Ravikumar andW. W. Cohen, A hierarchical graphical model for record linkage, in: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI '04, AUAI Press, Arlington, Virginia, United States, (2004), 454-461. http: //dlacm. org/citation. cfm?id=1036843. 1036898.
6. W. E. Winkler, Methods for record linkage and bayesian networks, Technical Report, Statistical Research Division, U. S. Census Bureau, 1994.
7. M. A. Hernández and S. J. Stolfo, The merge/purge problem for large databases, SIGMOD Rec 24 (1995), 127-138.
8. A. E. Monge and C. Elkan, An efficient domain-independent algorithm for detecting approximately duplicate database records, in: DMKD, (1997). URL: http://dblp. uni-trier. de/db/conf/dmkd/dmkd97. html#MongeE97.
9. S. Sarawagi and A. Bhamidipaty, Interactive deduplication using active learning, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, ACM, New York, NY, USA, (2002), 269-278. URL: http://doi. acm. org/10. 1145/775047. 775087. doi: 101145/775047. 775087.
10. R. Ananthakrishna, S. Chaudhuri and V. Ganti, Eliminating fuzzy duplicates in data warehouses, in: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB '02, VLDB Endowment, (2002), 586-597. URL: http:// dlacm. org/citation. cfm?id=1287369. 1287420.
11. W. W. Cohen, H. A. Kautz and D. A. McAllester, Hardening soft information sources, in: KDD, R. Ramakrishnan, S. J. Stolfo, R. J. Bayardo and I. Parsa, eds, ACM, (2000), 255-259. URL: http://dblp. uni-trier. de/db/conf/kdd/kdd2000. html# CohenKM00.
12. A. McCallum, K. Nigam and L. H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, (2000), 169-178.
13. P. Singla and P. Domingos, Entity resolution with markov logic, in: In ICDM, IEEE Computer Society Press, (2006), 572-582.
14. O. Benjelloun, H. Garcia-Molina, D. Menestrina, Q. Su, S. E. Whang and J. Widom, Swoosh: A generic approach to entity resolution, VLDB J 18 (2009), 255-276.
15. L. Getoor and A. Machanavajjhala, Entity resolution for big data, in: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, (2013), 1527-1527.
16. J. Efremova, B. Ranjbar-Sahraei, F. A. Oliehoek, T. Calders and K. Tuyls, A baseline method for genealogical entity resolution, in: Workshop on Population Reconstruction, (2014).
17. I. Bhattacharya and L. Getoor, Entity resolutions in graphs, in: Mining Graph Data, D. Cook and L. Holder, eds, Wiley, 2006.
18. L. Kolb and E. Rahm, Parallel entity resolution with dedoop, Datenbank-Spektrum 13 (2013), 23-32.
19. S. E. Whang, D. Menestrina, G. Koutrika, M. Theobald and H. Garcia-molina, Entity resolution with iterative blocking, Technical Report, 2008.
20. S. Whang and H. Garcia-Molina, Entity resolution with evolving rules, PVLDB 3 (2010), 1326-1337.
21. W. E. Winkler, String comparator metrics and enhanced decision rules in the fellegi-sunter model of record linkage, 1990.
22. G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys (CSUR) 33 (2001), 31-88.
23. J. Efremova, B. Ranjbar-Sahraei and T. Calders, A hybrid disambiguation measure for inaccurate cultural heritage data, in: The 8th Workshop on Language Technology for Cultural Heritage, Social Sciences, and Humanities, (2014).
24. P. Bogdanov and A. K. Singh, Function prediction using neighborhood patterns, in: BioKDD Workshop, (2008).
25. J. He, M. Li, H.-J. Zhang, H. Tong and C. Zhang, Manifold-ranking based image retrieval, in: Proceedings of the 12th Annual ACM International Conference on Multimedia, MULTIMEDIA '04, ACM, New York, NY, USA, (2004), 9-16. URL: http://doi. acm. org/10. 1145/1027527. 1027531. doi: 101145/1027527. 1027531.
26. G. Jeh and J. Widom, Simrank: A measure of structural-context similarity, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, ACM, New York, NY, USA, (2002), 538-543. URL: http://doi. acm. org/10. 1145/775047. 775126. doi: 101145/775047. 775126.
27. L. Page, S. Brin, R. Motwani and T. Winograd, The pagerank citation ranking: Bringing order to the web, in: Proceedings of the 7th International World Wide Web Conference, Brisbane, Australia, (1998), 161-172. URL: citeseer. nj. nec. com/ page98pagerankhtml.
28. A. E. Monge and C. Elkan, An efficient domain-independent algorithm for detecting approximately duplicate database records, in: DMKD, (1997).
29. W. E. Winkler, Matching and record linkage, Business Survey Methods 1 (1995), 355-384.
30. A. Monge and C. Elkan, The field matching problem: Algorithms and applications, in: In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, (1996), 267-270.
31. G. Navarro, A guided tour to approximate string matching, ACM Comput Surv 33 (2001), 31-88.
32. W. W. Cohen, P. Ravikumar and S. E. Fienberg, in: Proceedings of IJCAI-03 Workshop on Information Integration.
33. S. Chaudhuri, K. Ganjam, V. Ganti and R. Motwani, Robust and efficient fuzzy match for online data cleaning, in: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD '03, ACM, New York, NY, USA, (2003), 313-324. URL: http://doi. acm. org/10. 1145/872757. 872796. doi: 101145/872757. 872796.
34. E. S. Ristad, P. N. Yianilos and S. Member, Learning string edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (1998), 522-532.
35. M. Bilenko and R. J. Mooney, Adaptive duplicate detection using learnable string similarity measures, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, ACM, New York, NY, USA, (2003), 39-48. URL: http://doi. acm. org/10. 1145/956750. 956759. doi: 101145/956750. 956759.
36. W. W. Cohen and J. Richman, Learning to match and cluster large high-dimensional data sets for data integration, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, ACM, New York, NY, USA, (2002), 475-480. URL: http://doi. acm. org/10. 1145/775047. 775116. doi: 10. 1145/775047. 775116.
37. S. Tejada, C. A. Knoblock and S. Minton, Learning object identification rules for information integration, Information Systems 26 (2001), 2001.
38. S. Sarawagi and A. Bhamidipaty, Interactive deduplication using active learning, in: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002), (2002), 269-278.
39. N. Koudas, A. Marathe and D. Srivastava, Flexible string matching against large databases in practice, in: Proceedings of the Thirtieth International Conference on Very Large Data Bases-Volume 30, VLDB '04, VLDB Endowment, (2004), 1078-1086. URL: http://dlacm. org/citation. cfm?id=1316689. 1316782.
40. W. E. Yancey and W. E. Yancey, Evaluating string comparator performance for record linkage, Technical Report, Bureau of the Census, 2005.
41. M. Bilenko, R. Mooney, W. Cohen, P. Ravikumar and S. Fienberg, Adaptive name matching in information integration, IEEE Intelligent Systems 18 (2003), 16-23.
42. P. Singla and P. Domingos, Multi-relational record linkage, in: KDD-2004 Workshop on Multi-Relational Data Mining, (2004), 31-48.
43. X. Dong, A. Halevy and J. Madhavan, Reference reconciliation in complex information spaces, in: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD '05, ACM, New York, NY, USA, (2005), 85-96. URL: http://doi. acm. org/10. 1145/1066157. 1066168. doi: 101145/1066157. 1066168.
44. D. V. Kalashnikov and S. Mehrotra, Domain-independent data cleaning via analysis of entity-relationship graph, ACM Trans Database Syst 31 (2006), 716-767.
45. A. Doan, Y. Lu, Y. Lee and J. Han, Object matching for information integration: A profiler-based approach, in: Proceedings of the IJCAI-2003 Workshop on Information Integration on the Web, Acapulco, Mexico, (2003), 53-58.
46. J. Neville, M. Adler and D. Jensen, Clustering relational data using attribute and link information, in: In Proceedings of the Text Mining and Link Analysis Workshop, 18th International Joint Conference on Artificial Intelligence, (2003), 9-15.
47. E. F. Codd, The Relational Model for Database Management: Version 2, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1990.
48. R. A. Elmasri and S. B. Navathe, Fundamentals of Database Systems, 3rd edition, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999.
49. M. McPherson, L. Smith-Lovin and J. M. Cook, Birds of a feather: Homophily in social networks, Annual Review of Sociology 27 (2001), 415-444.
50. A. McCallum, K. Nigam and L. H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '00, ACM, New York, NY, USA, (2000), 169-178. URL: http://doi. acm. org/10. 1145/347090. 347123. doi: 101145/347090. 347123.
51. R. Baxter, P. Christen and T. Churches, A comparison of fast blocking methods for record linkage, in: ACM SIGKDD '03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, (2003), 25-27.
52. M. Bilenko, B. Kamath and R. J. Mooney, Adaptive blocking: Learning to scale up record linkage, in: ICDM, IEEE Computer Society, (2006), 87-96. URL: http://dblp. uni-trier. de/db/conf/icdm/icdm2006. html#BilenkoKM06.
53. L. O. Evangelista, E. Cortez, A. S. da Silva and W. Meira, Jr, Adaptive and flexible blocking for record linkage tasks, JIDM 1 (2010), 167-182.
54. D. Knuth, The art of computer programming 1: Fundamental algorithms 2: Seminumerical algorithms 3: Sorting and searching, 1968.
55. L. Philips, Hanging on the metaphone, Computer Language 7 (1990).
56. L. Philips, The double metaphone search algorithm, C/C++ Users Journal 18 (2000), 38-43.
57. H. Rahmani, B. Ranjbar-Sahraei, G. Weiss and K. Tuyls, Contextual entity resolution approach for genealogical data, in: Workshop on Knowledge Discovery, Data Mining and Machine Learning, (2014).
58. M. Institute, Meertens institute databases, 2014. URL: http://www. meertens. knaw. nl/cms/en/collections/databases.
59. T. Can, O. Çamo?glu and A. K. Singh, Analysis of protein-protein interaction networks using random walks, in: Proceedings of the 5th International Workshop on Bioinformatics, ACM, (2005), 61-68.
60. I. Bhattacharya and L. Getoor, Collective entity resolution in relational data, ACMTransactions on Knowledge Discovery From Data (TKDD) 1 (2007), 5.
61. D. S. Moore, G. P. McCabe and B. A. Craig, Introduction to the Practice of Statistics: Extended, W. H. Freeman, New York, 2009. URL: http://opac. inria. fr/record=b1131072.
62. R. V. Krejcie and D. W. Morgan, Determining sample size for research activities, Educational and Psychological Measurement 30 (1970), 607-610.
63. J. Efremova, B. Ranjbar-Sahraei, F. A. Oliehoek, T. Calders and K. Tuyls, An interactive, web-based tool for genealogical entity resolution, in: 25th Benelux Conference on Artificial Intelligence, (2013), 376-377.
64. V. Koenraad, C. Myriam and D. Jan, A short manual to the art of prosopography, in: Prosopography Approaches and Applications A Handbook, K.-R. K. S. B., ed., Unit for Prosopographical Research (Linacre College), Oxford, (2007), 35-69.
65. M. Elloumi and A. Y. Zomaya, Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data, 1st edition, Wiley Publishing, 2013.
66. U. Stelzl, U. Worm, M. Lalowski, C. Haenig, F. H. Brembeck, H. Goehler, M. Stroedicke, M. Zenkner, A. Schoenherr, S. Koeppen, J. Timm, S. Mintzlaff, C. Abraham, N. Bock, S. Kietzmann, A. Goedde, E. ToksÃ?uz, A. Droege, S. Krobitsch, B. Korn, W. Birchmeier, H. Lehrach and E. E. Wanker, A human protein-protein interaction network: A resource for annotating the proteome, Cell 122 (2005), 957-968.
67. T. Milenkovi and N. Prulj, Uncovering biological network function via graphlet degree signatures, Cancer Informatics 6 (2008), 257-273.
68. Z. Dezso, Y. Nikolsky, T. Nikolskaya, J. Miller, D. Cherba, C. Webb and A. Bugrim, Identifying disease-specific genes based on their topological significance in protein networks, BMC Systems Biology 3 (2009), 36+.
69. H. Ruffner, A. Bauer and T. Bouwmeester, Human protein-protein interaction networks and the value for drug discovery, Drug Discovery Today 12 (2007), 709-716.