메뉴 건너뛰기




Volumn , Issue , 2011, Pages 304-307

Efficient entity resolution methods for heterogeneous information spaces

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK PROCESSING; BLOCKING METHOD; BLOCKING TECHNIQUE; EXPERIMENTAL STUDIES; HETEROGENEOUS INFORMATION; HIGH FLEXIBILITY; INTELLIGENT TECHNIQUES; REAL WORLD DATA; REAL-WORLD ENTITIES; RESOLUTION METHODS; SCALE-UP; SEMI STRUCTURED DATA;

EID: 79958070483     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2011.5767671     Document Type: Conference Paper
Times cited : (16)

References (22)
  • 2
    • 11144240583 scopus 로고    scopus 로고
    • A comparison of string distance metrics for name-matching tasks
    • W. W. Cohen, P. D. Ravikumar, and S. E. Fienberg, "A comparison of string distance metrics for name-matching tasks," in IIWeb, 2003.
    • (2003) IIWeb
    • Cohen, W.W.1    Ravikumar, P.D.2    Fienberg, S.E.3
  • 5
    • 77952280581 scopus 로고    scopus 로고
    • Harra: Fast iterative hashed record linkage for large-scale data collections
    • H. sik Kim and D. Lee, "Harra: fast iterative hashed record linkage for large-scale data collections," in EDBT, 2010, pp. 525-536.
    • (2010) EDBT , pp. 525-536
    • Sik Kim, H.1    Lee, D.2
  • 7
    • 74549152150 scopus 로고    scopus 로고
    • Robust record linkage blocking using suffix arrays
    • T. de Vries, H. Ke, S. Chawla, and P. Christen, "Robust record linkage blocking using suffix arrays," in CIKM, 2009, pp. 305-314.
    • (2009) CIKM , pp. 305-314
    • De Vries, T.1    Ke, H.2    Chawla, S.3    Christen, P.4
  • 9
    • 36348932551 scopus 로고    scopus 로고
    • Learning blocking schemes for record linkage
    • M. Michelson and C. A. Knoblock, "Learning blocking schemes for record linkage," in AAAI, 2006.
    • (2006) AAAI
    • Michelson, M.1    Knoblock, C.A.2
  • 11
    • 0242456803 scopus 로고    scopus 로고
    • Learning domainindependent string transformation weights for high accuracy object identification
    • S. Tejada, C. A. Knoblock, and S. Minton, "Learning domainindependent string transformation weights for high accuracy object identification," in KDD, 2002.
    • (2002) KDD
    • Tejada, S.1    Knoblock, C.A.2    Minton, S.3
  • 12
    • 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
  • 13
    • 33745266392 scopus 로고    scopus 로고
    • Domain-independent data cleaning via analysis of entity-relationship graph
    • D. V. Kalashnikov and S. Mehrotra, "Domain-independent data cleaning via analysis of entity-relationship graph," TODS, 2006.
    • (2006) TODS
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 14
    • 17244380794 scopus 로고    scopus 로고
    • Semantic integration research in the database community: A brief survey
    • A. Doan and A. Y. Halevy, "Semantic integration research in the database community: A brief survey," AI Magazine, 2005.
    • (2005) AI Magazine
    • Doan, A.1    Halevy, A.Y.2
  • 15
    • 34250670467 scopus 로고    scopus 로고
    • Record linkage: Similarity measures and algorithms
    • N. Koudas, S. Sarawagi, and D. Srivastava, "Record linkage: similarity measures and algorithms," in SIGMOD, 2006.
    • (2006) SIGMOD
    • Koudas, N.1    Sarawagi, S.2    Srivastava, D.3
  • 17
    • 33846320077 scopus 로고    scopus 로고
    • Supporting efficient record linkage for large data sets using mapping techniques
    • C. Li, L. Jin, and S. Mehrotra, "Supporting efficient record linkage for large data sets using mapping techniques," World Wide Web, vol. 9, no. 4, pp. 557-584, 2006.
    • (2006) World Wide Web , vol.9 , Issue.4 , pp. 557-584
    • Li, C.1    Jin, L.2    Mehrotra, S.3
  • 19
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, and L. H. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in KDD, 2000, pp. 169-178.
    • (2000) KDD , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 20
    • 84878049861 scopus 로고    scopus 로고
    • Adaptive blocking: Learning to scale up record linkage
    • M. Bilenko, B. Kamath, and R. J. Mooney, "Adaptive blocking: Learning to scale up record linkage," in ICDM, 2006, pp. 87-96.
    • (2006) ICDM , pp. 87-96
    • Bilenko, M.1    Kamath, B.2    Mooney, R.J.3
  • 21
    • 79952386495 scopus 로고    scopus 로고
    • Efficient entity resolution for large heterogeneous information spaces
    • G. Papadakis, E. Ioannou, C. Niederée, and P. Fankhauser, "Efficient entity resolution for large heterogeneous information spaces," in WSDM, 2011.
    • (2011) WSDM
    • Papadakis, G.1    Ioannou, E.2    Niederée, C.3    Fankhauser, P.4
  • 22
    • 79956009487 scopus 로고    scopus 로고
    • The missing links: Discovering hidden same-as links among a billion of triples
    • G. Papadakis, G. Demartini, P. Krger, and P. Fankhauser, "The missing links: Discovering hidden same-as links among a billion of triples," in iiWAS, 2010.
    • (2010) IiWAS
    • Papadakis, G.1    Demartini, G.2    Krger, P.3    Fankhauser, P.4


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