首页> 外文会议>IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies >Hybrid Algorithm for Precise Recommendation from Almost Infinite Set of Websites
【24h】

Hybrid Algorithm for Precise Recommendation from Almost Infinite Set of Websites

机译:用于几乎无限的网站的精确推荐混合算法

获取原文

摘要

Typically, recommendation systems are used for increasing users' activity and spending. Most of them select a recommendation from a finite set of objects (e.g. News, products etc.) but in some cases the number of objects is so huge that standard approach based on similarity of objects will not work. The paper presents recommendation algorithms which work with an almost infinite set of websites by utilizing inherent characteristic of web pages and services delivered by search engines. Proposed algorithms were validated with the help of data from an Article Feedback Tool used on English Wikipedia for evaluating trustworthiness of articles. As the algorithms were developed to meet the special requirements of the Reconcile plug in, a community based websites' credibility evaluation system, performance of proposed solutions have been measured not only as precision and recall but also in terms of increasing inflow of credibility assessments for new websites. Gathered results show that is possible to create effective recommendation systems, which offer better scalability and lesser computational complexity than standard recommendation systems.
机译:通常,推荐系统用于增加用户的活动和支出。其中大多数选择来自有限一套对象(例如新闻,产品等)的建议,但在某些情况下,对象的数量是如此庞大的是基于物体相似性的标准方法不起作用。本文提供了通过利用搜索引擎提供的网页和服务的固有特性,与几乎无限的网站一起使用的推荐算法。在英语维基百科的文章反馈工具的帮助下,验证了验证了算法,用于评估文章的可信度。由于开发了算法以满足协调插头的特殊要求,基于社区的网站的信誉评估系统,所提出的解决方案的性能不仅可以作为精度和召回,而且还在增加新的可信度评估的流入方面网站。收集的结果表明,可以创建有效的推荐系统,该系统提供比标准推荐系统更好的可扩展性和较小的计算复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号