首页> 外文学位 >Federated query processing using ontology structure and ranking in a service oriented environment.
【24h】

Federated query processing using ontology structure and ranking in a service oriented environment.

机译:在面向服务的环境中使用本体结构和排名进行联合查询处理。

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

摘要

In view of the need for highly distributed and federated architecture, ranking data sources (ontologies) and robust query expansion in a specific domain have great impact on the performance and accuracy of web applications. Since robust query expansion exploits multiple data sources (ontologies) instead of a single ontology, ontology ranking is considered as a precursor for robust query expansion. Ontology ranking determines quality of an ontology and commonality of overlapping entities across different ontologies of the same domain. For this, first, we calculate the similarity of ontologies by an Entropy Based Distribution (EBD) measurement based on commonality of overlapping entities. Next, we determine robust expansion terms by a number of semantic measures. We consider each individual ontology and user query keywords to determine the Basic Expansion Terms (BET) based on the structure of ontology. We use Density Measure (DM), Betweenness Measure (BM), Semantic Similarity Measure (SSM) and Weight of Semantic Path (WSP) to calculate BET. Then, we specify New Expansion Terms (NET) using the ontology alignment (OA). Further, we determine the Robust Expansion Term (RET) using a dynamic threshold. We propose Map-Reduce algorithms for computing all the above metrics to make our algorithms efficient and scalable. Ontology rank is used as a heuristic to determine dynamic threshold and k-top relevant terms for each user query. Finally, we compare the result of our novel ontology-driven expansion approach with another existing semantic widget as well as wordnet and show the effectiveness of our robust expansion in federated architecture.
机译:考虑到需要高度分布式和联合的体系结构,在特定域中对数据源(本体)进行排名和强大的查询扩展对Web应用程序的性能和准确性有很大影响。由于健壮的查询扩展利用多个数据源(本体)而不是单个本体,因此本体排名被认为是健壮的查询扩展的前提。本体排名确定本体的质量以及同一域中不同本体之间重叠实体的共性。为此,首先,我们基于重叠实体的共性通过基于熵的分布(EBD)度量来计算本体的相似性。接下来,我们通过多种语义度量确定健壮的扩展项。我们考虑每个个体本体和用户查询关键字,以根据本体的结构确定基本扩展术语(BET)。我们使用密度度量(DM),中间度量(BM),语义相似度量(SSM)和语义权重(WSP)来计算BET。然后,我们使用本体对齐方式(OA)指定新扩展条​​款(NET)。此外,我们使用动态阈值确定稳健扩展项(RET)。我们提出了Map-Reduce算法来计算上述所有指标,以使我们的算法高效且可扩展。本体等级用作启发式方法,以确定每个用户查询的动态阈值和k-top相关术语。最后,我们将我们新颖的本体驱动的扩展方法的结果与另一个现有的语义小部件以及词网进行了比较,并展示了在联邦体系结构中稳健扩展的有效性。

著录项

  • 作者

    Alipanah, Neda.;

  • 作者单位

    The University of Texas at Dallas.;

  • 授予单位 The University of Texas at Dallas.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2012
  • 页码 114 p.
  • 总页数 114
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 康复医学;
  • 关键词

  • 入库时间 2022-08-17 11:42:32

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号