Discovering Associations in XML Data

  • Authors:
  • Amnon Meisels;Michael Orlov;Tal Maor

  • Affiliations:
  • -;-;-

  • Venue:
  • WISEW '02 Proceedings of the Third International Conference on Web Information Systems Engineering (Workshops) - (WISEw'02)
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items.In fact, the working assumption of the present study is that frequent sub-trees of XML data represent sets of tags (objects) that aremeaningfully associated. A method for extracting frequent sub-trees from XML data is presented. It uses thresholds on frequenciesof paths and on the multiplicity of paths in the data. The frequent sub-trees are extracted and counted in a procedure that has O(n2) complexity. The data content of the extracted sub-trees, in the form of attribute values, is cast in tabular form. This enables a search forassociations in the extracted data. Thus, the complete procedure uses structure and content to extract association rules from semi-structureddata. A large industrial example is used to demonstrate the operation of the proposed method.