首页> 外文学位 >Learning implicit user interest hierarchy for Web personalization.
【24h】

Learning implicit user interest hierarchy for Web personalization.

机译:学习隐式的用户兴趣层次结构以进行Web个性化。

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

摘要

Most web search engines are designed to serve all users in a general way, without considering the interests of individual users. In contrast, personalized web search engines incorporate an individual user's interests when choosing relevant web pages to return. In order to provide a more robust context for personalization, a user interest hierarchy (UIH) is presented. The UIH extracts a continuum of general to specific user interests from web pages and generates a uniquely personalized order to search results.; This dissertation consists of five main parts. First, a divisive hierarchical clustering (DHC) algorithm is proposed to group words (topics) into a hierarchy where more general interests are represented by a larger set of words. Second, a variable-length phrase-finding (VPF) algorithm that finds meaningful phrases from a web page is introduced. Third, two new desirable properties that a correlation function should satisfy are proposed. These properties will help understand the general characteristics of a correlation function and help choose or devise correct correlation functions for an application domain. Fourth, methods are examined that (re)rank the results from a search engine depending on user interests based on the contents of a web page and the UIH. Fifth, previously studied implicit indicators for interesting web pages are evaluated. The time spent on a web page and other new indicators are examined in more detail as well.; Experimental results indicate that the personalized ranking methods presented in this study, when used with a popular search engine, can yield more relevant web pages for individual users. The precision/recall analysis showed that our weighted term scoring function could provide more accurate ranking than Google on average.
机译:大多数网络搜索引擎旨在以通用方式为所有用户提供服务,而无需考虑单个用户的利益。相反,个性化的Web搜索引擎在选择要返回的相关Web页面时会结合个人用户的兴趣。为了提供用于个性化的更健壮的上下文,提出了用户兴趣层次结构(UIH)。 UIH从网页中提取一般用户对特定用户兴趣的连续体,并生成唯一个性化的搜索结果顺序。本文由五个主要部分组成。首先,提出了一种划分性的层次聚类(DHC)算法,用于将单词(主题)分组到一个层次结构中,其中更大的一组单词代表了更多的普遍兴趣。其次,引入了可变长度短语查找(VPF)算法,该算法从网页中查找有意义的短语。第三,提出了相关函数应满足的两个新的理想性质。这些属性将有助于了解相关函数的一般特征,并有助于为应用程序域选择或设计正确的相关函数。第四,研究了根据网页和UIH的内容根据用户兴趣对搜索引擎的结果进行(重新)排名的方法。第五,评估了先前研究的有趣网页的隐式指标。也将更详细地检查花费在网页上的时间和其他新指标。实验结果表明,本研究中介绍的个性化排名方法与流行的搜索引擎一起使用时,可以为个人用户提供更多相关的网页。精确度/召回率分析表明,我们的加权术语评分功能可以提供比Google平均更准确的排名。

著录项

  • 作者

    Kim, Hyoung-rae.;

  • 作者单位

    Florida Institute of Technology.;

  • 授予单位 Florida Institute of Technology.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 189 p.
  • 总页数 189
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号