首页> 外文期刊>Formal Aspects of Computing >Finding semantic associations in hierarchically structured groups of Web data
【24h】

Finding semantic associations in hierarchically structured groups of Web data

机译:在Web数据的层次结构化组中查找语义关联

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

摘要

Most of the activities usually performed by Web users are today effectively supported by using appropriate metadata that make the Web practically readable by software agents operating as users' assistants. While the original use of metadata mostly focused on improving queries on Web knowledge bases, as in the case of SPARQL-based applications on RDF data, other approaches have been proposed to exploit the semantic information contained in metadata for performing more sophisticated knowledge discovery tasks. Finding semantic associations between Web data seems a promising framework in this context, since it allows that novel, potentially interesting information can emerge by the Web's sea, deeply exploiting the semantic relationships represented by metadata. However, the approaches for finding semantic associations proposed in the past do not seem to consider how Web entities are logically collected into groups, that often have a complex hierarchical structure. In this paper, we focus on the importance of taking into account this additional information, and we propose an approach for finding semantic associations which would not emerge without considering the structure of the data groups. Our approach is based on the introduction of a new metadata model, that is an extension of the direct, labelled graph allowing the possibility to have nodes with a hierarchical structure. To evaluate our approach, we have implemented it on the top of an existing recommender system for Web users, experimentally analyzing the introduced advantages in terms of effectiveness of the recommendation activity.
机译:如今,通过使用适当的元数据可以有效地支持通常由Web用户执行的大多数活动,这些适当的元数据可以使充当用户助手的软件代理切实阅读Web。尽管元数据的原始用途主要集中在改进Web知识库上的查询,例如RDF数据上基于SPARQL的应用程序,但已提出了其他方法来利用元数据中包含的语义信息来执行更复杂的知识发现任务。在这种情况下,找到Web数据之间的语义关联似乎是一个很有前途的框架,因为它允许Web的海面涌现出新颖的,潜在有趣的信息,从而深入利用元数据表示的语义关系。但是,过去提出的查找语义关联的方法似乎没有考虑Web实体如何逻辑上收集到通常具有复杂层次结构的组中。在本文中,我们将重点放在考虑这些附加信息的重要性上,并提出一种用于查找语义关联的方法,而这种语义关联将在不考虑数据组的结构的情况下出现。我们的方法基于引入新的元数据模型,这是对直接标记图的扩展,从而允许具有分层结构的节点。为了评估我们的方法,我们已经在针对Web用户的现有推荐系统的顶部实施了该方法,并根据推荐活动的有效性对引入的优势进行了实验性分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号