{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:57:55Z","timestamp":1753441075486},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p>Identifying records referring to the same real world entity over time enables longitudinal data analysis. However, difficulties arise from the dynamic nature of the world: the entities described by a temporal data set often evolve their states over time. While the state of the art approach to temporal entity matching achieves high accuracy, this approach is computationally expensive and cannot handle large data sets. In this paper, we present an approach that achieves equivalent matching accuracy but takes far less time. Our key insight is \"static first, dynamic second.\" Our approach first runs an evidence-collection pass, grouping records without considering the possibility of entity evolution, as if the world were \"static.\" Then, it merges clusters from the initial grouping by determining whether an entity might evolve from the state described in one cluster to the state described in another cluster. This intuitively reduces a difficult problem, record matching with evolution, to two simpler problems: record matching without evolution, then \"evolution detection\" among the resulting clusters. Experimental results on several temporal data sets show that our approach provides an order of magnitude improvement in run time over the state-of-the-art approach while producing equivalent matching accuracy.<\/jats:p>","DOI":"10.14778\/2732279.2732284","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"469-480","source":"Crossref","is-referenced-by-count":15,"title":["Tracking entities in the dynamic world"],"prefix":"10.14778","volume":"7","author":[{"given":"Yueh-Hsuan","family":"Chiang","sequence":"first","affiliation":[{"name":"University of Wisconsin Madison, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AnHai","family":"Doan","sequence":"additional","affiliation":[{"name":"University of Wisconsin Madison, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey F.","family":"Naughton","sequence":"additional","affiliation":[{"name":"University of Wisconsin Madison, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,2]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Academic patenting in Europe (APE-INV). http:\/\/www.esf-ape-inv.eu\/.  Academic patenting in Europe (APE-INV). http:\/\/www.esf-ape-inv.eu\/."},{"key":"e_1_2_1_2_1","unstructured":"The DBLP computer science bibliography. http:\/\/www.informatik.uni-trier.de\/~ley\/db\/.  The DBLP computer science bibliography. http:\/\/www.informatik.uni-trier.de\/~ley\/db\/."},{"key":"e_1_2_1_3_1","unstructured":"Fec-standardizer - an experiment to standardize individual donor names in campaign finance data. https:\/\/github.com\/cjdd3b\/fec-standardizer.  Fec-standardizer - an experiment to standardize individual donor names in campaign finance data. https:\/\/github.com\/cjdd3b\/fec-standardizer."},{"key":"e_1_2_1_4_1","unstructured":"Twitter - an online social networking and microblogging service. https:\/\/twitter.com\/.  Twitter - an online social networking and microblogging service. https:\/\/twitter.com\/."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.006"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.65"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2401764"},{"key":"e_1_2_1_8_1","volume-title":"Proc. of the KDD-2004 Workshop on Multi-Relational Data Mining. KDD","author":"Domingos P.","year":"2004","unstructured":"P. Domingos . Multi-relational record linkage . In Proc. of the KDD-2004 Workshop on Multi-Relational Data Mining. KDD , 2004 . P. Domingos. Multi-relational record linkage. In Proc. of the KDD-2004 Workshop on Multi-Relational Data Mining. KDD, 2004."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687771"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402733"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.15"},{"key":"e_1_2_1_14_1","first-page":"9","volume-title":"USA","author":"Weikum G.","year":"2011","unstructured":"G. Weikum , N. Ntarmos , M. Spaniol , P. Triantafillou , A. Bencz\u00far , S. Kirkpatrick , P. Rigaux , and M. Williamson . Longitudinal analytics on web archive data: It's about time! In Proceedings of the 5th biennial Conference on Innovative Data Systems Research (CIDR), Asilomar, CA , USA , January , pages 9 -- 12 , 2011 . G. Weikum, N. Ntarmos, M. Spaniol, P. Triantafillou, A. Bencz\u00far, S. Kirkpatrick, P. Rigaux, and M. Williamson. Longitudinal analytics on web archive data: It's about time! In Proceedings of the 5th biennial Conference on Innovative Data Systems Research (CIDR), Asilomar, CA, USA, January, pages 9--12, 2011."},{"key":"e_1_2_1_15_1","volume-title":"Statistical Research Division","author":"Winkler W.","year":"2002","unstructured":"W. Winkler . Methods for record linkage and bayesian networks. Technical report , Statistical Research Division , US Census Bureau , Washington, DC , 2002 . W. Winkler. Methods for record linkage and bayesian networks. Technical report, Statistical Research Division, US Census Bureau, Washington, DC, 2002."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920899"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732279.2732284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:09:52Z","timestamp":1672225792000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732279.2732284"}},"subtitle":["a fast algorithm for matching temporal records"],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["10.14778\/2732279.2732284"],"URL":"https:\/\/doi.org\/10.14778\/2732279.2732284","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}