메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2211-2217

Leveraging unlabeled data to scale blocking for record linkage

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING TECHNIQUE; LABELED DATA; LARGE DATASETS; MACHINE LEARNING PROBLEM; PROCESS OF LEARNING; REAL-WORLD ENTITIES; RECORD LINKAGE; UNLABELED DATA;

EID: 84881036145     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-369     Document Type: Conference Paper
Times cited : (20)

References (16)
  • 1
    • 38749118638 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, 2006.
    • (2006) FOCS
    • Andoni, A.1    Indyk, P.2
  • 2
    • 52649111585 scopus 로고    scopus 로고
    • Nearest neighbor retrieval using distance-based hashing
    • Vassilis Athitsos, Michalis Potamias, Panagiotis Papapetrou, and George Kollios. Nearest neighbor retrieval using distance-based hashing. In ICDE, 2008.
    • (2008) ICDE
    • Athitsos, V.1    Potamias, M.2    Papapetrou, P.3    Kollios, G.4
  • 3
    • 5444258997 scopus 로고    scopus 로고
    • A comparison of fast blocking methods for record linkage
    • Rohan Baxter and Peter Christen. A comparison of fast blocking methods for record linkage. In SIGKDD, pages 25-27, 2003.
    • (2003) SIGKDD , pp. 25-27
    • Baxter, R.1    Christen, P.2
  • 4
    • 84878049861 scopus 로고    scopus 로고
    • Adaptive blocking: Learning to scale up record linkage
    • Mikhail Bilenko, Beena Kamath, and Raymond J. Mooney. Adaptive blocking: Learning to scale up record linkage. In ICDM, pages 87-96, 2006.
    • (2006) ICDM , pp. 87-96
    • Bilenko, M.1    Kamath, B.2    Mooney, R.J.3
  • 5
    • 0036203458 scopus 로고    scopus 로고
    • Tailor: A record linkage tool box
    • Mohamed G. Elfeky, Ahmed K. Elmagarmid, and Vassilios S. Verykios. Tailor: A record linkage tool box. In ICDE, pages 17-28, 2002.
    • (2002) ICDE , pp. 17-28
    • Elfeky, M.G.1    Elmagarmid, A.K.2    Verykios, V.S.3
  • 6
    • 84871062493 scopus 로고    scopus 로고
    • Adaptive and flexible blocking for record linkage tasks
    • Luiz Osvaldo Evangelista, Eli Cortez, Altigran Soares da Silva, and Wagner Meira Jr. Adaptive and flexible blocking for record linkage tasks. JIDM, 1(2):167-182, 2010.
    • (2010) JIDM , vol.1 , Issue.2 , pp. 167-182
    • Evangelista, L.O.1    Cortez, E.2    Da Silva, A.S.3    Meira Jr., W.4
  • 7
    • 84881068240 scopus 로고    scopus 로고
    • Adaptive filtering for efficient record linkage
    • Lifang Gu and Rohan A. Baxter. Adaptive filtering for efficient record linkage. In ICDM, 2004.
    • (2004) ICDM
    • Gu, L.1    Baxter, R.A.2
  • 8
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. Miller and J. Thatcher, editors, Plenum Press
    • Richard M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 9
    • 77952280581 scopus 로고    scopus 로고
    • Harra: Fast iterative hashed record linkage for large-scale data collections
    • Hung-Sik Kim and Dongwon Lee. Harra: Fast iterative hashed record linkage for large-scale data collections. In EDBT, pages 525-536, 2010.
    • (2010) EDBT , pp. 525-536
    • Kim, H.-S.1    Lee, D.2
  • 10
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • Andrew McCallum, Kamal Nigam, and Lyle H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In SIGKDD, pages 169-178, 2000.
    • (2000) SIGKDD , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 11
    • 33750728911 scopus 로고    scopus 로고
    • Learning blocking schemes for record linkage
    • Matthew Michelson and Craig A. Knoblock. Learning blocking schemes for record linkage. In AAAI, volume 1, pages 440-445, 2006.
    • (2006) AAAI , vol.1 , pp. 440-445
    • Michelson, M.1    Knoblock, C.A.2
  • 13
    • 0001139918 scopus 로고
    • Record linkage: Making maximum use of the discriminating power of identifying information
    • Howard B. Newcombe and James 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
  • 14
    • 84956869850 scopus 로고    scopus 로고
    • Approximation algorithms for the label-covermax and red-blue set cover problems
    • David Peleg. Approximation algorithms for the label-covermax and red-blue set cover problems. In SWAT, pages 220-230, 2000.
    • (2000) SWAT , pp. 220-230
    • Peleg, D.1
  • 16
    • 36348961379 scopus 로고    scopus 로고
    • Adaptive sorted neighborhood methods for efficient record linkage
    • Su Yan, Dongwon Lee, Min-Yen Kan, and C. Lee Giles. Adaptive sorted neighborhood methods for efficient record linkage. In JCDL, pages 185-194, 2007.
    • (2007) JCDL , pp. 185-194
    • Yan, S.1    Lee, D.2    Kan, M.-Y.3    Giles, C.L.4


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