JCSE, vol. 3, no. 2, pp.109-126, June, 2009

DOI:

Merging Taxonomies under RCC-5 Algebraic Articulations

David Thau Shawn Bowers Bertram Ludaescher
Dept. of Computer Science, University of California at Davis, USA|Genome Center, University of California at Davis, USA|Dept. of Computer Science, University of California at Davis, USA

Abstract: Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomiesoften exist for the same domain. Given a set of correspondences between two taxonomies, it isoften necessary to “merge” the taxonomies, thereby creating a unied taxonomy (e.g., that canthen be used by data integration and discovery applications). We present an algorithm formerging taxonomies that have been related using articulations given as RCC-5 constraints. Twotaxa N and M can be related using (disjunctions of) the ve base relations in RCC-5: N≡M; NM; N; N?M (partial overlap of N and M); and N!M (disjointness: N∩M = ?). RCC-5 is increasingly being adopted by scientists to specify mappings between large biolo

Keyword: No keyword

Full Paper:   143 Downloads, 4304 View