Now days, web search engines provide good services in terms of retrieval and presentation of the information to the user. A foremost difficulty in the moder'/> A novel framework to facilitate personalized web search in a dual mode
首页> 外文期刊>Cluster computing >A novel framework to facilitate personalized web search in a dual mode
【24h】

A novel framework to facilitate personalized web search in a dual mode

机译:一种新颖的框架,可在双模式下促进个性化网络搜索

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

摘要

AbstractNow days, web search engines provide good services in terms of retrieval and presentation of the information to the user. A foremost difficulty in the modern and ever growing web is the lack of user interest adaption in the process of web search. All users are presented with the same set of search engine result pages (SERPs) for a given input query string, since it follows the keyword based search. The limitation of keyword based search is (i) uncertain user needs and (ii) improper query selection. If the programmer is searching for a query “switch”, it refers to the switch statement of a programming language and for an electrical engineer, the context of search is the physical house hold switch component. In addition to that a user may fall short in choosing the proper query for search that best articulate their information need. Hence, it is evident that keyword searches have tough time to distinguish the user context over the query. A typical approach to focus on this challenge is a personalized web search strategy where the results are retrieved based on the user interest and preferences. The three different major search modules are: (i) building user profiles (ii) re-ranking the SERPs in personal mode and (iii) re-ranking the SERPs in group mode. The proposed work stands for contributing in the field of user profile construction and personalized page ranking. A new method of user model representation termed as Preference Network is constructed. The proposed system can work in both initialization and maintenance mode to build a new or update an existing model. Both the short term and long term interest are utilized to rank the SERPs. The user interest score and group interest score are computed dynamically.
机译:<标题>抽象 ara id =“par3”>现在,Web搜索引擎在检索和向用户呈现信息方面提供良好的服务。现代和不断增长的网络中最重要的困难是在Web搜索过程中缺乏用户兴趣适应。对于给定的输入查询字符串,所有用户都以相同的搜索引擎结果页面(SERPS)呈现,因为它遵循基于关键字的搜索。基于关键字的搜索的限制是(i)不确定的用户需求和(ii)不正确的查询选择。如果程序员正在搜索查询“交换机”,则指的是编程语言和电气工程师的交换机语句,搜索的上下文是物理房屋保持开关组件。除了用户可能在选择适当的查询时可能缺少,以便搜索最佳阐明其信息需要。因此,很明显,关键字搜索具有艰难的时间来区分用户上下文在查询上。专注于此挑战的典型方法是个性化的网络搜索策略,在那里基于用户的兴趣和偏好来检索结果。这三个不同的主要搜索模块是:(i)构建用户配置文件(ii)在个人模式中重新排名SERPS和(iii)在组模式下重新排列SERPS。拟议的工作代表在用户简介施工和个性化页面中的贡献。构建了作为偏好网络称为偏好网络的新方法。所提出的系统可以在初始化和维护模式下工作,以构建新的或更新现有模型。短期和长期利息都用于对SERP进行排名。用户兴趣评分和组兴趣分数是动态计算的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号