首页> 外文期刊>International Journal of Innovative Research in Science, Engineering and Technology >Tree Based Association Rules for Mining in XML Query ?Answering
【24h】

Tree Based Association Rules for Mining in XML Query ?Answering

机译:XML查询中基于树的挖掘关联规则

获取原文
           

摘要

Extracting information from semi structured documents is a very difficult task, and is going to become more and more dangerous as the amount of digital information available on the Internet grows. In reality, documents are often so large that the data set returned as answer to a query may be too big to convey interpretable knowledge. In this Tree-Based Association Rules (TARs) are used mined rules, which provide approximate, intensional information on both the structure and the contents of Extensible Markup Language (XML) documents, and can be stored in XML structure as well. This mined information is later used to provide: 1) a concise idea-the gist-of both the structure and the content of the XML document and 2) quick, approximate answers to queries. A prototype system and experimental results demonstrate the effectiveness of the approach. The mined rules are used for user query processing. The updation in the mined document and the optimization of the algorithm is going to be performed.
机译:从半结构化文档中提取信息是一项非常艰巨的任务,并且随着Internet上可用的数字信息量的增长,它将变得越来越危险。实际上,文档通常太大,以至于作为查询答案返回的数据集可能太大而无法传达可解释的知识。在此基于树的关联规则(TAR)中,使用了挖掘规则,这些规则提供有关可扩展标记语言(XML)文档的结构和内容的近似,内涵信息,并且也可以存储在XML结构中。此挖掘的信息随后用于提供:1)XML文档的结构和内容的简要思想(要点),以及2)快速,近似的查询答案。原型系统和实验结果证明了该方法的有效性。挖掘的规则用于用户查询处理。挖掘文档中的更新和算法的优化将要执行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号