메뉴 건너뛰기




Volumn , Issue , 2007, Pages 293-302

Structure-based inference of XML similarity for fuzzy duplicate detection

Author keywords

Bayesian networks; Duplicate detection; XML

Indexed keywords

COMPLEX STRUCTURES; DATA CLEANINGS; DATA INTEGRATIONS; DATA SOURCES; DUPLICATE DETECTION; GRAPH DATUM; HIGH PRECISION; MISSING INFORMATIONS; MULTIPLE REPRESENTATIONS; NOVEL METHODS; REAL-WORLD OBJECTS; RELATIONAL DATUM; SEMI-STRUCTURED; SIMILARITY MEASURES; STRUCTURE-BASED; XML DATABASE; XML DATUM;

EID: 63449096532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321483     Document Type: Conference Paper
Times cited : (35)

References (29)
  • 4
    • 33745448357 scopus 로고    scopus 로고
    • A latent dirichlet model for unsupervised entity resolution
    • Bethesda, MD
    • I. Bhattacharya and L. Getoor. A latent dirichlet model for unsupervised entity resolution. In Conference on Data Mining (SDM), Bethesda, MD, 2006.
    • (2006) Conference on Data Mining (SDM)
    • Bhattacharya, I.1    Getoor, L.2
  • 5
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • Washington, DC
    • M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In Conference on Knowledge Discovery and Data Mining (KDD), pages 39-48, Washington, DC, 2003.
    • (2003) Conference on Knowledge Discovery and Data Mining (KDD) , pp. 39-48
    • Bilenko, M.1    Mooney, R.J.2
  • 7
    • 0242540438 scopus 로고    scopus 로고
    • Learning to match and cluster large high-dimensional data sets for data integration
    • Edmonton, Alberta, Canada
    • W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In Conference on Knowledge Discovery and Data Mining (KDD), pages 475-480, Edmonton, Alberta, Canada, 2002.
    • (2002) Conference on Knowledge Discovery and Data Mining (KDD) , pp. 475-480
    • Cohen, W.W.1    Richman, J.2
  • 14
    • 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. ACM Transactions on Database Systems (TODS), 31(2):716-767, 2006.
    • (2006) ACM Transactions on Database Systems (TODS) , vol.31 , Issue.2 , pp. 716-767
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 17
    • 0001592068 scopus 로고
    • Automatic linkage of vital records
    • H. Newcombe, J. Kennedy, S. Axford, and A. James. Automatic linkage of vital records. Science 130, (3381):954-959, 1959.
    • (1959) Science , vol.130 , Issue.3381 , pp. 954-959
    • Newcombe, H.1    Kennedy, J.2    Axford, S.3    James, A.4
  • 20
    • 0002490026 scopus 로고    scopus 로고
    • Data cleaning: Problems and current approaches
    • E. Rahm and H. H. Do. Data cleaning: Problems and current approaches. IEEE Data Engineering Bulletin, 23:3-13, 2000.
    • (2000) IEEE Data Engineering Bulletin , vol.23 , pp. 3-13
    • Rahm, E.1    Do, H.H.2
  • 28
    • 63449090269 scopus 로고    scopus 로고
    • W. E. Winkler. Overview of record linkage and current research directions. Technical report, U. S. Bureau of the Census, 2006.
    • W. E. Winkler. Overview of record linkage and current research directions. Technical report, U. S. Bureau of the Census, 2006.


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