首页> 外文会议>2013 International Conference on Information Communication and Embedded Systems >Mining intensional information for answering XML-queries using tree-based association rules approach
【24h】

Mining intensional information for answering XML-queries using tree-based association rules approach

机译:使用基于树的关联规则方法挖掘内涵信息以回答XML查询

获取原文
获取原文并翻译 | 示例

摘要

Nowadays web pages are mostly XML based and most of this information does not have well-defined Document Type Definition (DTD) or Schema. They are relatively huge document and incomplete in nature. Therefore effective answering of the XML document is tedious as it leads to irrelevant and more generic results thereby failed to offer the specific user's needs. To avoid this problem, an approach based on Tree-based Association Rule (TAR) mining was proposed, using which for efficient answering the frequent paths and references of its occurrence will be extracted and it is stored in XML format for both ordered and unordered XML document. The constructed XML file is used for query answering; thereby it provides quick and approximate answers to user's query. The user's query is automatically transferred into a query format that retrieves information from the constructed XML file.
机译:如今,网页主要基于XML,并且大多数此类信息都没有明确定义的文档类型定义(DTD)或架构。它们是相对较大的文档,本质上是不完整的。因此,对XML文档的有效回答很繁琐,因为它导致不相关且更通用的结果,从而无法满足特定用户的需求。为避免此问题,提出了一种基于树型关联规则(TAR)挖掘的方法,该方法可有效回答常见路径并提取其出现的引用,并以XML格式存储有序和无序XML。文献。构造的XML文件用于查询应答。从而为用户的查询提供快速而近似的答案。用户的查询将自动转换为从已构造的XML文件中检索信息的查询格式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号