.png){kind=icon}
返回
Computing simple and complex matchings between XML schemas for transforming XML documents
.png){kind=icon}
PRE
AI
DOI：10.1016/j.infsof.2005.12.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas based on proposed ontology and leaf node similarity, and extracting final matchings based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. Furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method performs better than previous methodologies, resulting in a precision of 97% and a recall of 83% on the average. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
XML
schema matching
dynamic ontology
complex matching
simple matching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
3.8K
被引数:
7.7K
机构
暂无机构信息
引用论文
Learning to match the schemas of data sources: A multistrategy approach学习匹配数据源的模式: 一种多策略方法.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏Chinese and Japanese Students’ Conceptions of the ‘Ideal English Lesson’中日学生对 “理想英语课” 的概念RELC Journal
RELC JournalIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容