首页> 外文会议>International Conference on Data Engineering Workshops >Searching and Ranking Documents based on Semantic Relationships
【24h】

Searching and Ranking Documents based on Semantic Relationships

机译:根据语义关系搜索和排序文档

获取原文

摘要

Just as the link structure of the web is a critical component in today's web search, complex relationships (i.e., the different ways the dots are connected) will be an important component in tomorrow's web search technologies. In this paper, I summarize my research on answering the question of: How we can exploit semantic relationships of named-entities to improve relevance in search and ranking of documents? The intuition of my approach is to first analyze the relationships of named-entities with respect to a query. Second, relevance weights, which are assigned by human experts, can then be used to guarantee results within a relevance threshold. These relevance measures can be applied both for searching and ranking of documents.
机译:正如Web的链接结构是当今网络搜索中的关键组件,复杂的关系(即,点连接的不同方式)将是明天的网络搜索技术中的重要组成部分。在本文中,我总结了我对回答问题的研究:我们如何利用命名实体的语义关系,以改善搜索和排名中的文档中的相关性?我的方法的直觉是首先将命名实体的关系分析到查询。其次,由人类专家分配的相关权重,然后可以用于保证相关性阈值的结果。这些相关性措施都可以应用于搜索和排名。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号