기관회원 [로그인]
소속기관에서 받은 아이디, 비밀번호를 입력해 주세요.
개인회원 [로그인]

비회원 구매시 입력하신 핸드폰번호를 입력해 주세요.
본인 인증 후 구매내역을 확인하실 수 있습니다.

회원가입
서지반출
Merging Taxonomies under RCC-5 Algebraic Articulations
[STEP1]서지반출 형식 선택
파일형식
@
서지도구
SNS
기타
[STEP2]서지반출 정보 선택
  • 제목
  • URL
돌아가기
확인
취소
  • Merging Taxonomies under RCC-5 Algebraic Articulations
  • Merging Taxonomies under RCC-5 Algebraic Articulations
저자명
Thau. David,Bowers. Shawn,Ludaescher. Bertram
간행물명
Journal of computing science and engineering
권/호정보
2009년|3권 2호|pp.109-126 (18 pages)
발행정보
한국정보과학회
파일정보
정기간행물|ENG|
PDF텍스트
주제분야
기타
이 논문은 한국과학기술정보연구원과 논문 연계를 통해 무료로 제공되는 원문입니다.
서지반출

기타언어초록

Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain. Given a set of correspondences between two taxonomies, it is often necessary to "merge" the taxonomies, thereby creating a unied taxonomy (e.g., that can then be used by data integration and discovery applications). We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints. Two taxa Nand M can be related using (disjunctions of) the ve base relations in RCC-5: M; N ${subseteq}$M; N ${supseteq}$; N ${oplus}$M (partial overlap of Nand M); and N ! M (disjointness: N ${cap}$M = ${varnothing}$). RCC-5 is increasingly being adopted by scientists to specify mappings between large biological taxonomies. We discuss the properties of the proposed merge algorithm and evaluate our approach using real-world taxonomies.