RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기

    (A)generalization of band joins and the merge/purge problem

    한글로보기

    https://www.riss.kr/link?id=M9597989

    • 저자
    • 발행사항

      Ann Arbor, MI: UMI, 1997, c1996

    • 발행연도

      1997

    • 작성언어

      영어

    • 주제어
    • DDC

      005.74 판사항(21)

    • ISBN

      0231422962

    • 자료형태

      일반단행본

    • 서명/저자사항

      (A)generalization of band joins and the merge/purge problem / Mauricio Antonio Hern´andez-Sherrington

    • 원본출판사항

      New York : The University of Columbia, 1996, Thesis(Ph.D.)

    • 형태사항

      xii, 171 p.: ill.; 22 cm.

    • 소장기관
      • 국립중앙도서관 국립중앙도서관 우편복사 서비스
    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
      • URL 복사
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

    목차 (Table of Contents)

    • CONTENTS
    • Table of Contents = ⅰ
    • List of Figures = ⅳ
    • List of Tables = ⅶ
    • 1 Introduction = 1
    • CONTENTS
    • Table of Contents = ⅰ
    • List of Figures = ⅳ
    • List of Tables = ⅶ
    • 1 Introduction = 1
    • 2 Previous Work = 8
    • 2.1 Record Linkage = 9
    • 2.2 Heterogenous Multi-Databases = 11
    • 2.3 Sorting with Duplicate Elimination = 14
    • 2.4 Band-Joins = 15
    • 3 The Merge/Purge Problem = 20
    • 3.1 The Sorted Neighborhood Method = 21
    • 3.1.1 The naive Sorted-Neighborhood Method = 24
    • 3.1.2 The Duplicate Elimination sorted-Neighborhood Method = 27
    • 3.2 Clustering the data first = 31
    • 3.2.1 Alternative Clustering Strategies = 33
    • 3.3 Equational theory = 34
    • 3.4 Computing the transitive closure over the results of independent runs = 38
    • 3.5 A General-Purpose Merge/Purge Engine = 42
    • 4 Experimental Results = 45
    • 4.1 Generating the databases = 45
    • 4.2 Pre-processing the generated database = 47
    • 4.3 Initial results on accuracy = 49
    • 4.4 The Duplicate Elimination Method = 52
    • 4.5 The Clustering Method = 57
    • 4.6 Analysis = 60
    • 5 Parallel Implementation = 67
    • 5.1 Single and Multi-pass sorted-neighborhood method = 67
    • 5.2 Single and Multi-pass clustering method = 72
    • 5.3 Scaling Up = 74
    • 6 A Real-Word Test Case = 76
    • 6.1 Database Description = 77
    • 6.2 using Merge/Purge over OCAR's data = 79
    • 6.3 A Purge Application = 84
    • 6.4 Results over the entire OCAR database = 90
    • 7 Optimizations = 96
    • 7.1 Link Minimization = 96
    • 7.2 A State-Saving Multi-pass approach = 103
    • 7.2.1 Experimental Results = 107
    • 7.3 Incremental Merge / Purge = 113
    • 7.3.1 Initial experimental results = 117
    • 8 Conclusion = 121
    • 8.1 Summary = 121
    • 8.2 Contributions = 124
    • 8.3 Future Work = 125
    • Bibliography = 127
    • A Person Database Programs = 135
    • A.1 Original OPS5 version of the equational theory = 135
    • A.2 Schema Definition = 140
    • A.3 Pre-processing Code = 141
    • A.4 Equational Theory Code = 142
    • B. OCAR's Database Programs = 144
    • B.1 Schema Definition = 144
    • B.2 Pre-processing Code = 145
    • B.3 Equational Theory Code = 147
    • B.4 purge Rules = 154
    • C. Accuracy Results = 156
    • C.1 Number of Duplicates per Record = 157
    • C.2 Size of Input Database = 160
    • C.3 Level of noise = 162
    • D. Relevant Communications = 166
    • D.1 Timothy Clark's request in KDD-Nuggets 95 : 7 = 166
    • D.2 Data Cleaner's performance assessment over OCAR's data = 168
    • D.3 Gratitute letter from OCAR = 170
    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼