一种XML的树匹配改进方法  

Improved method of tree matching using XML

作　　者：于亚君[1,2] 姜瑛[1,2,3] 

机构地区：[1]昆明理工大学信息工程与自动化学院,昆明650500 [2]云南省计算机技术应用重点实验室,昆明650500 [3]昆明理工大学质量发展研究院,昆明650093

出　　处：《计算机工程与应用》2012年第20期177-181,210,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60703116;No.61063006);云南省教育厅科学研究基金重点项目(No.2010Z017)

摘　　要：基于XML树的匹配已被广泛应用于数据挖掘、自然语言自处理、图像检索等领域。通过分析现有的基于XML树的匹配度计算方法,发现存在对计算的前期要求(如权值分割)太过严格、匹配度结果存在误差等问题,影响了匹配的精度和效率。基于XML的内容约束和结构约束,综合结点相似度和层次相似度,提出一种结构相似度计算公式,改进了匹配计算结果的准确度,并通过实验验证了公式的有效性。Tree matching based on XML has been widely used in many domains, including data mining, natural language processing, image retrieval and etc. The existing tree matching calculation methods based on XML are studied. There are some problems that founded in the existing method of matching calculation, such as strict requirement before calculation（weight division）, errors in the result of matching, which will affect the matching accuracy and efficiency. In order to resolve the existing problems in formula and achieve better matching results, this paper computes the node similarity and the level similarity based on the constraints of content and structural of XML. A formula of the structural similarity is presented, which can improve the accuracy of matching results. The validity of the formula is proved through experiments.

关 键 词：可扩展标示语言(XML) 树匹配 相似度计算 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]