메뉴 건너뛰기




Volumn , Issue , 2005, Pages 3-12

Relational clustering for multi-type entity resolution

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS;

EID: 80052662115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1090193.1090195     Document Type: Conference Paper
Times cited : (42)

References (30)
  • 1
    • 2342576574 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
  • 3
    • 29844458352 scopus 로고    scopus 로고
    • Iterative record linkage for cleaning and integration
    • I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In DMKD, 2004.
    • (2004) DMKD
    • Bhattacharya, I.1    Getoor, L.2
  • 5
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, 2003.
    • (2003) KDD
    • Bilenko, M.1    Mooney, R.J.2
  • 6
    • 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
  • 8
    • 0242540438 scopus 로고    scopus 로고
    • Learning to match and cluster large high-dimensional data sets for data integration
    • W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In KDD, 2002.
    • (2002) KDD
    • Cohen, W.W.1    Richman, J.2
  • 13
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. A. Hernandez and S. J. Stolfo. The merge/purge problem for large databases. In SIGMOD, 1995.
    • (1995) SIGMOD
    • Hernandez, M.A.1    Stolfo, S.J.2
  • 14
    • 33749549879 scopus 로고    scopus 로고
    • Exploiting relationships for domain-independent data cleaning
    • Newport Beach, CA, USA, April 21-23
    • D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM SDM, Newport Beach, CA, USA, April 21-23 2005.
    • (2005) SIAM SDM
    • Kalashnikov, D.V.1    Mehrotra, S.2    Chen, Z.3
  • 16
    • 33646398530 scopus 로고    scopus 로고
    • Conditional models of identity uncertainty with application to noun coreference
    • A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In NIPS, 2004.
    • (2004) NIPS
    • McCallum, A.1    Wellner, B.2
  • 17
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. K. 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.K.1    Nigam, K.2    Ungar, L.3
  • 19
    • 85018108837 scopus 로고    scopus 로고
    • The field matching problem: Algorithms and applications
    • A. E. Monge and C. P. Elkan. The field matching problem: Algorithms and applications. In KDD, 1996.
    • (1996) KDD
    • Monge, A.E.1    Elkan, C.P.2
  • 20
    • 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 DMKD, 1997.
    • (1997) DMKD
    • Monge, A.E.1    Elkan, C.P.2
  • 21
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33 (l): 31-88, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 25
    • 26844557708 scopus 로고    scopus 로고
    • A hierarchical graphical model for record linkage
    • P. Ravikumar and W. W. Cohen. A hierarchical graphical model for record linkage. In UAI, 2004.
    • (2004) UAI
    • Ravikumar, P.1    Cohen, W.W.2
  • 26
  • 27
    • 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
  • 28
    • 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


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