...
首页> 外文期刊>Knowledge and information systems >Towards a graph-based user profile modeling for a session-based personalized search
【24h】

Towards a graph-based user profile modeling for a session-based personalized search

机译:迈向基于图表的用户个人资料建模,以进行基于会话的个性化搜索

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

获取外文期刊封面封底 >>

       

摘要

Most Web search engines use the content of the Web documents and their link structures to assess the relevance of the document to the user's query. With the growth of the information available on the web, it becomes difficult for such Web search engines to satisfy the user information need expressed by few keywords. First, personalized information retrieval is a promising way to resolve this problem by modeling the user profile by his general interests and then integrating it in a personalized document ranking model. In this paper, we present a personalized search approach that involves a graph-based representation of the user profile. The user profile refers to the user interest in a specific search session defined as a sequence of related queries. It is built by means of score propagation that allows activating a set of semantically related concepts of reference ontology, namely the ODP. The user profile is maintained across related search activities using a graph-based merging strategy. For the purpose of detecting related search activities, we define a session boundary recognition mechanism based on the Kendall rank correlation measure that tracks changes in the dominant concepts held by the user profile relatively to a new submitted query. Personalization is performed by re-ranking the search results of related queries using the user profile. Our experimental evaluation is carried out using the HARD 2003 TREC collection and showed that our session boundary recognition mechanism based on the Kendall measure provides a significant precision comparatively to other non-ranking based measures like the cosine and the WebJaccard similarity measures. Moreover, results proved that the graph-based search personalization is effective for improving the search accuracy.
机译:大多数Web搜索引擎都使用Web文档的内容及其链接结构来评估文档与用户查询的相关性。随着网络上可用信息的增长,这样的网络搜索引擎难以满足用很少的关键字表示的用户信息需求。首先,个性化信息检索是解决该问题的一种有前途的方式,可以通过按照用户的一般兴趣对用户个人资料进行建模,然后将其集成到个性化文档排名模型中。在本文中,我们提出了一种个性化的搜索方法,其中包括基于图形的用户个人资料表示。用户资料是指用户对特定搜索会话的兴趣,该特定搜索会话定义为一系列相关查询。它是通过分数传播构建的,该分数传播允许激活一组与语义相关的参考本体概念,即ODP。使用基于图的合并策略跨相关搜索活动维护用户个人资料。为了检测相关的搜索活动,我们基于Kendall排名相关性度量定义了会话边界识别机制,该机制可跟踪用户配置文件相对于新提交的查询所占主导概念的变化。通过使用用户个人资料重新排列相关查询的搜索结果来执行个性化设置。我们使用HARD 2003 TREC集合进行了实验评估,结果表明,与其他基于非排名的度量(例如余弦和WebJaccard相似性度量)相比,基于Kendall度量的会话边界识别机制提供了显着的精度。而且,结果证明基于图的搜索个性化对于提高搜索精度是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号