메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 529-534

Query-time entity resolution

Author keywords

Adaptive; Entity resolution; Query; Relations

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; ADAPTIVE SYSTEMS; DATA MINING; INFORMATION RETRIEVAL; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 33749549918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150463     Document Type: Conference Paper
Times cited : (34)

References (17)
  • 1
    • 0344756851 scopus 로고    scopus 로고
    • Eliminating fuzzy duplicates in data warehouses
    • R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, 2002.
    • (2002) VLDB
    • Ananthakrishna, R.1    Chaudhuri, S.2    Ganti, V.3
  • 5
    • 1142279457 scopus 로고    scopus 로고
    • Robust and efficient fuzzy match for online data cleaning
    • S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Chaudhuri, S.1    Ganjam, K.2    Ganti, V.3    Motwani, R.4
  • 6
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • X. Dong, A. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Dong, X.1    Halevy, A.2    Madhavan, J.3
  • 7
    • 0006408706 scopus 로고
    • Localized partial evaluation of belief networks
    • D. Draper and S. Hanks. Localized partial evaluation of belief networks. In UAI, 1994.
    • (1994) UAI
    • Draper, D.1    Hanks, S.2
  • 8
    • 29844448776 scopus 로고    scopus 로고
    • Conquer: Efficient management of inconsistent databases
    • A. Fuxman, E. Fazli, and R. Miller. Conquer: Efficient management of inconsistent databases. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Fuxman, A.1    Fazli, E.2    Miller, R.3
  • 9
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. Hernández and S. Stolfo. The merge/purge problem for large databases. In SIGMOD, 1995.
    • (1995) SIGMOD
    • Hernández, M.1    Stolfo, S.2
  • 10
    • 33749549879 scopus 로고    scopus 로고
    • Exploiting relationships for domain-independent data cleaning
    • D. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM SDM, 2005.
    • (2005) SIAM SDM
    • Kalashnikov, D.1    Mehrotra, S.2    Chen, Z.3
  • 12
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In KDD, 2000.
    • (2000) KDD
    • McCallum, A.1    Nigam, K.2    Ungar, L.3
  • 13
    • 33646398530 scopus 로고    scopus 로고
    • Conditional model's of identity uncertainty with application to noun coreference
    • A. McCallum and B. Wellner. Conditional model's of identity uncertainty with application to noun coreference. In NIPS, 2004.
    • (2004) NIPS
    • McCallum, A.1    Wellner, B.2
  • 14
    • 85018108837 scopus 로고    scopus 로고
    • The field matching problem: Algorithms and applications
    • A. Monge and C. Elkan. The field matching problem: Algorithms and applications. In KDD, 1996.
    • (1996) KDD
    • Monge, A.1    Elkan, C.2
  • 17
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In KDD, 2002.
    • (2002) KDD
    • Sarawagi, S.1    Bhamidipaty, A.2


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