返回
Enriching One Taxonomy Using Another
DOI:10.1109/TKDE.2009.189.png)
摘要
En 中文
Taxonomies, representing hierarchical data, are a key knowledge source in multiple disciplines. Information processing across taxonomies is not possible unless they are appropriately merged for commonalities and differences. For taxonomy merging, the first task is to identify common concepts between the taxonomies. Then, these common concepts along with their associated concepts in the two taxonomies need to be integrated. Doing this in a conflict-free manner is a challenging task and generally requires human intervention. In this paper, we explore the possibility of asymmetrically merging one taxonomy into another automatically. Given one or more source taxonomies and a destination taxonomy, modeled as directed acyclic graphs, we present intuitive algorithms that merge relevant portions of the source taxonomies into the destination taxonomy. We prove that our algorithms are conflict-free, information lossless, and scalable. We also define precision and recall measures for evaluating enriched taxonomies, such as T-A, the result of merging two taxonomies, with T-I, the ideal merger. Our experiments indicate the effectiveness of our approach.
Keyword:
Taxonomy merging
graph merging algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
The Semantic Web - A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities语义网-一种对计算机有意义的新形式的网络内容将引发一场新可能性的革命
SCIENTIFIC AMERICAN
IF3.1
Complexing and exchange of boron, aluminum, and gallium chlorides with some Lewis bases硼,铝和镓氯化物与某些路易斯碱的络合和交换
没有更多内容

