基于数据挖掘技术的XML频繁模式发掘-系统工程专业论文.docxVIP

II II Abstract As a kind of simple, open and extensible self-describing language, XML is not only an emerging Internet standard for data representation and exchange, but also applied to Internet search engines, electronic commerce, EDI, etc. So much attention has been paid to XML. How toextract schema from XML documents and store XML data is an essential problem in XML-related research, which directly affects the efficiency and function of XML documents. Data mining Technology is to discover the hidden information from the data storage. Using Data mining arithmetics, Pepole can get the availability information that they wanted. With the scale of internet data become lager, peploe want to get information from these data, so data mining technology will be used more widly and more deeply. With wide using of XML, it is more and more important to extract valuableinformation, especially to mine potential rules and patterns in XML, so mining frequentpatterns from XML become an important research domain. In this paper, we discuss the meaning of frequent pattern mining tasks, and introduce a series of frequent pattern mining algorithms. Based on the existing frequent tree structure mining algorithm—WL[1], we present the XML data model XOEM(XML Object Exchange Model) and compressed structure tree, improve the pruning strategies of candidates and then bring forward an effective algorithm for XML frequent pattern discovery—DI(Dig Information). This is the major contributions of the thesis. This paper proves that DI has better performance than WL in the work of mining XML frequent patterns theoretically and experimentally, and gives a proof of the validity and feasibility of the XML data storage method presented in this paper by the implementation of an antetype model. Keywords: Data mining XML Frequent pattern mining WL Relationship Rule DI PAGE PAGE IV 目 录 摘 要 ······················································································I HYPERLINK \l _bookmark0