【24h】

User profile for personalized web search

机译:个性化网络搜索的用户个人资料

获取原文

摘要

Different users usually have different special information needs when they use search engines to find web information. The technologies of personalized web search can be used to solve the problem. An effective way to personalized search engines' results is to construct user profile to present an individual user's preference. Utilizing the relative machine learning techniques, three approaches are proposed to build the user profile in this paper. These approaches are called as Rocchio method, k-Nearest Neighbors method and Support Vector Machines method. Experimental results based on a constructed dataset show that k-Nearest Neighbors method is better than others for its efficiency and robustness.
机译:不同的用户在使用搜索引擎查找Web信息时通常具有不同的特殊信息需求。个性化网络搜索技术可以用来解决该问题。个性化搜索引擎结果的有效方法是构建用户个人资料,以呈现单个用户的偏好。利用相关的机器学习技术,本文提出了三种建立用户档案的方法。这些方法称为Rocchio方法,k最近邻方法和支持向量机方法。基于构造的数据集的实验结果表明,k最近邻方法的效率和鲁棒性优于其他方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号