메뉴 건너뛰기




Volumn , Issue , 2009, Pages 219-231

Entity resolution with iterative blocking

Author keywords

Blocking; Entity resolution; Iterative blocking

Indexed keywords

BLOCKING TECHNIQUE; LARGE DATASETS; PROCESSING TIME; REAL-WORLD ENTITIES;

EID: 70849098813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559870     Document Type: Conference Paper
Times cited : (202)

References (25)
  • 1
    • 0036949730 scopus 로고    scopus 로고
    • Correlation clustering
    • N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In FOCS, pages 238-, 2002.
    • FOCS , pp. 23-28
    • Bansal, N.1    Blum, A.2    Chawla, S.3
  • 5
    • 84878049861 scopus 로고    scopus 로고
    • Adaptive blocking: Learning to scale up record linkage
    • M. Bilenko, B. Kamath, and R. Mooney. Adaptive blocking: Learning to scale up record linkage. In ICDM, 2006.
    • (2006) ICDM
    • Bilenko, M.1    Kamath, B.2    Mooney, R.3
  • 6
    • 26444550791 scopus 로고    scopus 로고
    • Robust identification of fuzzy duplicates
    • Tokyo, Japan
    • S. Chaudhuri, V. Ganti, and R. Motwani. Robust identification of fuzzy duplicates. In Proc. of ICDE, Tokyo, Japan, 2005.
    • (2005) Proc. of ICDE
    • Chaudhuri, S.1    Ganti, V.2    Motwani, R.3
  • 7
    • 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
  • 10
    • 33845368103 scopus 로고    scopus 로고
    • Adaptive filtering for efficient record linkage
    • L. Gu and R. A. Baxter. Adaptive filtering for efficient record linkage. In SDM, 2004.
    • (2004) SDM
    • Gu, L.1    Baxter, R.A.2
  • 11
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • M. Hernandez and S. Stolfo. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Mining and Knowledge Discovery, 2(1):9-37, 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.1 , pp. 9-37
    • Hernandez, M.1    Stolfo, S.2
  • 12
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. A. Herńandez and S. J. Stolfo. The merge/purge problem for large databases. In Proc. of ACM SIGMOD, pages 127-138, 1995.
    • (1995) Proc. of ACM SIGMOD , pp. 127-138
    • Herńandez, M.A.1    Stolfo, S.J.2
  • 14
    • 0344612511 scopus 로고    scopus 로고
    • A small approximately min-wise independent family of hash functions
    • P. Indyk. A small approximately min-wise independent family of hash functions. J. Algorithms, 38(1):84-90, 2001.
    • (2001) J. Algorithms , vol.38 , Issue.1 , pp. 84-90
    • Indyk, P.1
  • 15
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets withapplication to reference matching
    • Boston, MA
    • A. K. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets withapplication to reference matching. In Proc. of KDD, pages 169-178, Boston, MA, 2000.
    • (2000) Proc. of KDD , pp. 169-178
    • McCallum, A.K.1    Nigam, K.2    Ungar, L.3
  • 16
    • 36348932551 scopus 로고    scopus 로고
    • Learning blocking schemes for record linkage
    • M. Michelson and C. Knoblock. Learning blocking schemes for record linkage. In AAAI, 2006.
    • (2006) AAAI
    • Michelson, M.1    Knoblock, C.2
  • 17
    • 0004043396 scopus 로고    scopus 로고
    • An efficient domain independent algorithm for detecting approximately duplicate database records
    • A. E. Monge and C. P. Elkan. An efficient domain independent algorithm for detecting approximately duplicate database records. In SIGMOD DMKD, 1997.
    • (1997) SIGMOD DMKD
    • Monge, A.E.1    Elkan, C.P.2
  • 19
    • 0001139918 scopus 로고
    • Record linkage: making maximum use of the discriminating power of identifying information
    • H. B. Newcombe and J. M. Kennedy. Record linkage: making maximum use of the discriminating power of identifying information. Commun. ACM, 5(11):563-566, 1962.
    • (1962) Commun. ACM , vol.5 , Issue.11 , pp. 563-566
    • Newcombe, H.B.1    Kennedy, J.M.2
  • 20
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • Edmonton, Alberta
    • S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In Proc. of ACM SIGKDD, Edmonton, Alberta, 2002.
    • (2002) Proc. of ACM SIGKDD
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 21
    • 0035545848 scopus 로고    scopus 로고
    • Learning object identification rules for information integration
    • S. Tejada, C. A. Knoblock, and S. Minton. Learning object identification rules for information integration. Information Systems Journal, 26(8):635-656, 2001.
    • (2001) Information Systems Journal , vol.26 , Issue.8 , pp. 635-656
    • Tejada, S.1    Knoblock, C.A.2    Minton, S.3
  • 24
    • 33750719826 scopus 로고    scopus 로고
    • Approximate string comparator search strategies for very large administrative lists
    • W. E. Winkler. Approximate string comparator search strategies for very large administrative lists. Technical report, US Bureau of the Census, 2005.
    • (2005) Technical report, US Bureau of the Census
    • Winkler, W.E.1
  • 25
    • 33845622202 scopus 로고    scopus 로고
    • Bigmatch: A program for extracting probable matches from a large file for record linkage
    • W. Yancey. Bigmatch: A program for extracting probable matches from a large file for record linkage. Technical report, US Bureau of the Census, 2002.
    • (2002) Technical report, US Bureau of the Census
    • Yancey, W.1


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