A Novel Method for Measuring Structure and Semantic Similarity of XML Documents Based on Extended Adjacency Matrix

被引:2
作者
Zhang, Xue-Liang [1 ]
Yang, Ting [1 ]
Fan, Bao-Quan [1 ]
Wang, Xu [1 ]
Wei, Jin-Mao [1 ]
机构
[1] Nankai Univ, Coll Informat Tech Sci, Tianjin 300071, Peoples R China
来源
INTERNATIONAL CONFERENCE ON APPLIED PHYSICS AND INDUSTRIAL ENGINEERING 2012, PT B | 2012年 / 24卷
关键词
similarity; XML; semantic; structure; adjacency matrix;
D O I
10.1016/j.phpro.2012.02.215
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Similarity measurement of XML documents is crucial to meet various needs of approximate searches and document classifications in XML-oriented applications. Some methods have been proposed for this purpose. Nevertheless, few methods can be elegantly exploited to depict structure and semantic information and hence to effectively measure the similarity of XML documents. In this paper, we present a new method of computing the structure and semantic similarity of XML documents based on extended adjacency matrix(EAM). Different from a general adjacency matrix, in an EAM, the structure information of not only the adjacent layers but also the ancestor-descendant layers can be stored. For measuring the similarity of two XML documents, the proposed method firstly stores the structure and semantic information in two extended adjacency matrices (M-1,M-2). Then it computes similarity of the two documents through cos(M-1,M-2). Experimental results on bench-mark data show that the method holds high efficiency and accuracy. (C) 2011 Published by Elsevier B.V. Selection and/or peer-review under responsibility of ICAPIE Organization Committee.
引用
收藏
页码:1452 / 1461
页数:10
相关论文
共 10 条
[1]  
Chawathe S., 1996, Proceedings of the ACM SIGMOD International Conference on Management of Data, P493
[2]  
Chawathe SS, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P90
[3]  
FLESCA S, 2002, P 5 INT WORKSH WEB D
[4]  
NIERMAN A, 2002, P 5 INT WORKSH WEB D
[5]  
Shasha D., 1995, PATTERN MATCHING STR
[6]   TREE-TO-TREE CORRECTION PROBLEM [J].
TAI, KC .
JOURNAL OF THE ACM, 1979, 26 (03) :422-433
[7]   A SYSTEM FOR APPROXIMATE TREE MATCHING [J].
WANG, JTL ;
ZHANG, KZ ;
JEONG, K ;
SHASHA, D .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1994, 6 (04) :559-571
[8]   The impact and implementation of XML on business-to-business commerce [J].
Yen, DC ;
Huang, SM ;
Ku, CY .
COMPUTER STANDARDS & INTERFACES, 2002, 24 (04) :347-362
[9]   NCDS: data mining for discovering interesting network characteristics [J].
Zaki, M ;
Sobh, TS .
INFORMATION AND SOFTWARE TECHNOLOGY, 2005, 47 (03) :189-198
[10]   SIMPLE FAST ALGORITHMS FOR THE EDITING DISTANCE BETWEEN TREES AND RELATED PROBLEMS [J].
ZHANG, KZ ;
SHASHA, D .
SIAM JOURNAL ON COMPUTING, 1989, 18 (06) :1245-1262