{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:09:58Z","timestamp":1759205398818,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030161446"},{"type":"electronic","value":"9783030161453"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16145-3_41","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:50:37Z","timestamp":1554346237000},"page":"526-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Robust Temporal Graph Clustering for Group Record Linkage"],"prefix":"10.1007","author":[{"given":"Charini","family":"Nanayakkara","sequence":"first","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10994-013-5421-0","volume":"95","author":"L Antonie","year":"2014","unstructured":"Antonie, L., Inwood, K., Lizotte, D.J., Ross, J.A.: Tracking people over time in 19th century Canada for longitudinal analysis. Mach. Learn. 95, 129\u2013146 (2014)","journal-title":"Mach. Learn."},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.7155\/jgaa.00084","volume":"8","author":"JA Aslam","year":"2004","unstructured":"Aslam, J.A., Pelekhov, E., Rus, D.: The star clustering algorithm for static and dynamic information organization. J. Graph Algorithms Appl. 8, 95\u2013129 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"41_CR3","unstructured":"Bailey, M., Cole, C., et al.: How well do automated methods perform in historical samples? Evidence from new ground truth. Technical report, NBER (2017)"},{"key":"41_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19884-2","volume-title":"Population Reconstruction","author":"G Bloothooft","year":"2015","unstructured":"Bloothooft, G., Christen, P., Mandemakers, K., Schraagen, M.: Population Reconstruction. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-19884-2"},{"key":"41_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"41_CR6","unstructured":"Christen, V., Gro\u00df, A., Fisher, J., Wang, Q., Christen, P., Rahm, E.: Temporal group linkage and evolution analysis for census data. In: EDBT, Venice (2017)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: ACM ICML, Pittsburgh, pp. 233\u2013240 (2006)","DOI":"10.1145\/1143844.1143874"},{"key":"41_CR8","unstructured":"Dibben, C., Williamson, L., Huang, Z.: Digitising Scotland (2012). http:\/\/gtr.rcuk.ac.uk\/projects?ref=ES\/K00574X\/2"},{"issue":"5","key":"41_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF00054021","volume":"30","author":"LY Dillon","year":"1996","unstructured":"Dillon, L.Y.: Integrating nineteenth-century Canadian and American census data sets. Comput. Hum. 30(5), 381\u2013392 (1996)","journal-title":"Comput. Hum."},{"issue":"328","key":"41_CR10","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"Fellegi, I.P., Sunter, A.B.: A theory for record linkage. J. Am. Stat. Assoc. 64(328), 1183\u20131210 (1969)","journal-title":"J. Am. Stat. Assoc."},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-06608-0_40","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Fu","year":"2014","unstructured":"Fu, Z., Christen, P., Zhou, J.: A graph matching method for historical census household linkage. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 485\u2013496. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06608-0_40"},{"issue":"3","key":"41_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11222-017-9746-6","volume":"28","author":"D Hand","year":"2018","unstructured":"Hand, D., Christen, P.: A note on using the f-measure for evaluating record linkage algorithms. Stat. Comput. 28(3), 539\u2013547 (2018)","journal-title":"Stat. Comput."},{"issue":"1","key":"41_CR13","first-page":"1282","volume":"2","author":"O Hassanzadeh","year":"2009","unstructured":"Hassanzadeh, O., Chiang, F., Lee, H.C., Miller, R.J.: Framework for evaluating clustering algorithms in duplicate detection. PVLDB 2(1), 1282\u20131293 (2009)","journal-title":"PVLDB"},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MC.2013.405","volume":"47","author":"HC Kum","year":"2014","unstructured":"Kum, H.C., Krishnamurthy, A., Machanavajjhala, A., Ahalt, S.C.: Social genome: putting big data to work for population informatics. IEEE Comput. 47(1), 56\u201363 (2014)","journal-title":"IEEE Comput."},{"key":"41_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2014)"},{"key":"41_CR16","unstructured":"Nanayakkara, C., Christen, P., Ranbaduge, T.: Temporal graph-based clustering for historical record linkage. In: MLG, held at ACM SIGKDD, London (2018)"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"On, B.W., Koudas, N., Lee, D., Srivastava, D.: Group linkage. In: IEEE ICDE, Istanbul (2007)","DOI":"10.1109\/ICDE.2007.367895"},{"issue":"1\u20132","key":"41_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.3366\/hac.2002.14.1-2.61","volume":"14","author":"A Reid","year":"2002","unstructured":"Reid, A., Davies, R., Garrett, E.: Nineteenth-century Scottish demography from linked censuses and civil registers. History Comput. 14(1\u20132), 61\u201386 (2002)","journal-title":"History Comput."},{"issue":"1","key":"41_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1146\/annurev-soc-073117-041447","volume":"44","author":"S Ruggles","year":"2018","unstructured":"Ruggles, S., Fitch, C.A., Roberts, E.: Historical census record linkage. Ann. Rev. Sociol. 44(1), 19\u201337 (2018)","journal-title":"Ann. Rev. Sociol."},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-66917-5_19","volume-title":"Advances in Databases and Information Systems","author":"A Saeedi","year":"2017","unstructured":"Saeedi, A., Peukert, E., Rahm, E.: Comparative evaluation of distributed clustering schemes for multi-source entity resolution. In: Kirikova, M., N\u00f8rv\u00e5g, K., Papadopoulos, G.A. (eds.) ADBIS 2017. LNCS, vol. 10509, pp. 278\u2013293. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66917-5_19"},{"key":"41_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-319-93417-4_37","volume-title":"The Semantic Web","author":"A Saeedi","year":"2018","unstructured":"Saeedi, A., Peukert, E., Rahm, E.: Using link features for entity clustering in knowledge graphs. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 576\u2013592. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_37"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16145-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:07:26Z","timestamp":1710335246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16145-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030161446","9783030161453"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16145-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pakdd2019.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft Conf. Man. Toolkit CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"542","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.79","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there were 31 PAKDD 2019 Workshops' papers accepted for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}