메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1565-1568

Similarity-aware indexing for real-time entity resolution

Author keywords

Approximate string matching; Data matching; Inverted indexing; Phonetic encoding; Record linkage; Scalability; Similarity query

Indexed keywords

APPROXIMATE STRING MATCHING; DATA MATCHING; INVERTED INDEXING; PHONETIC ENCODING; RECORD LINKAGE; SIMILARITY QUERY;

EID: 74549185155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646173     Document Type: Conference Paper
Times cited : (46)

References (9)
  • 1
    • 33845363891 scopus 로고    scopus 로고
    • A fast linkage detection scheme for multi-source information integration
    • Tokyo
    • A. Aizawa and K. Oyama. A fast linkage detection scheme for multi-source information integration. In WIRI'05, Tokyo, 2005.
    • (2005) WIRI'05
    • Aizawa, A.1    Oyama, K.2
  • 3
    • 35348849154 scopus 로고    scopus 로고
    • Scaling up all pairs similarity search
    • Banff, Canada
    • R. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW'07, Banff, Canada, 2007.
    • (2007) WWW'07
    • Bayardo, R.1    Ma, Y.2    Srikant, R.3
  • 5
    • 74549120106 scopus 로고    scopus 로고
    • Similarity-aware indexing for real-time entity resolution
    • Technical Report TR-CS-09-01, School of Computer Science, The Australian National University, Canberra, Australia
    • P. Christen, R. Gayler, and D. Hawking. Similarity-aware indexing for real-time entity resolution. Technical Report TR-CS-09-01, School of Computer Science, The Australian National University, Canberra, Australia, 2009.
    • (2009)
    • Christen, P.1    Gayler, R.2    Hawking, D.3
  • 6
    • 0242540438 scopus 로고    scopus 로고
    • Learning to match and cluster large high-dimensional data sets for data integration
    • Edmonton, Canada
    • W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In ACM SIGKDD'02, pages 475-480, Edmonton, Canada, 2002.
    • (2002) ACM SIGKDD'02 , pp. 475-480
    • Cohen, W.1    Richman, J.2
  • 7
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • San Jose
    • M. A. Hernandez and S. J. Stolfo. The merge/purge problem for large databases. In ACM SIGMOD'95, San Jose, 1995.
    • (1995) ACM SIGMOD'95
    • Hernandez, M.A.1    Stolfo, S.J.2
  • 8
    • 2942709772 scopus 로고    scopus 로고
    • Methods for evaluating and creating data quality
    • W. E. Winkler. Methods for evaluating and creating data quality. Elsevier Information Systems, 29(7):531-550, 2004.
    • (2004) Elsevier Information Systems , vol.29 , Issue.7 , pp. 531-550
    • Winkler, W.E.1
  • 9
    • 33747729581 scopus 로고    scopus 로고
    • Inverted files for text search engines
    • J. Zobel and A. Moffat. Inverted files for text search engines. ACM Computing Survery, 38(2), 2006.
    • (2006) ACM Computing Survery , vol.38 , Issue.2
    • Zobel, J.1    Moffat, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.