Mining frequent association tag sequences for clustering XML documents

  • Authors:
  • Lijun Zhang;Zhanhuai Li;Qun Chen;Xia Li;Ning Li;Ying Lou

  • Affiliations:
  • School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China;School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China;School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China;School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China;School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China;School of Computer Science and Technology, Northwestern Polytechnical University, Xi'an, China

  • Venue:
  • APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many XML document clustering algorithms need to compute similarity among documents. Due to its semi-structured characteristic, exploiting the structure information for computing structural similarity is a crucial issue in XML similarity computation. Some path based approaches model the structure as path set and use the path set to compute structural similarity. One of the defects of these approaches is that they ignore the relationship between paths. In this paper, we propose the conception of Frequent Association Tag Sequences (FATS). Based on this conception, we devise an algorithm named FATSMiner for mining FATS and model the structure of XML documents as FATS set, and introduce a method for computing structural similarity using FATS. Because FATS implies the ancestor-descendant and sibling relationships among elements, this approach can better represent the structure of XML documents. Our experimental results on real datasets show that this approach is more effective than the other path based approaches.