To compare or not to compare: making entity resolution more efficient
暂无分享,去创建一个
[1] Chen Li,et al. Supporting Efficient Record Linkage for Large Data Sets Using Mapping Techniques , 2006, World Wide Web.
[2] Peter Fankhauser,et al. Efficient entity resolution for large heterogeneous information spaces , 2011, WSDM '11.
[3] Craig A. Knoblock,et al. Learning Blocking Schemes for Record Linkage , 2006, AAAI.
[4] Ahmed K. Elmagarmid,et al. Duplicate Record Detection: A Survey , 2007, IEEE Transactions on Knowledge and Data Engineering.
[5] Claudia Niederée,et al. Eliminating the redundancy in blocking-based entity resolution methods , 2011, JCDL '11.
[6] Salvatore J. Stolfo,et al. The merge/purge problem for large databases , 1995, SIGMOD '95.
[7] Sanjay Chawla,et al. Robust record linkage blocking using suffix arrays , 2009, CIKM.
[8] Dongwon Lee,et al. HARRA: fast iterative hashed record linkage for large-scale data collections , 2010, EDBT '10.
[9] Andrew McCallum,et al. Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.
[10] Raymond J. Mooney,et al. Adaptive Blocking: Learning to Scale Up Record Linkage , 2006, Sixth International Conference on Data Mining (ICDM'06).
[11] Luis Gravano,et al. Approximate String Joins in a Database (Almost) for Free , 2001, VLDB.
[12] Georgia Koutrika,et al. Entity resolution with iterative blocking , 2009, SIGMOD Conference.