首页> 外文OA文献 >Network-Based Information Filtering Algorithms: Ranking and Recommendation
【2h】

Network-Based Information Filtering Algorithms: Ranking and Recommendation

机译:基于网络的信息过滤算法:排名和推荐

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

After the Internet and the World Wide Web have become popular andwidely-available, the electronically stored online interactions of individualshave fast emerged as a challenge for researchers and, perhaps even faster, as asource of valuable information for entrepreneurs. We now have detailed recordsof informal friendship relations in social networks, purchases on e-commercesites, various sorts of information being sent from one user to another, onlinecollections of web bookmarks, and many other data sets that allow us to posequestions that are of interest from both academical and commercial point ofview. For example, which other users of a social network you might want to befriend with? Which other items you might be interested to purchase? Who are themost influential users in a network? Which web page you might want to visitnext? All these questions are not only interesting per se but the answers tothem may help entrepreneurs provide better service to their customers and,ultimately, increase their profits.
机译:在互联网和万维网变得流行和广泛使用之后,以电子方式存储的个人在线互动迅速成为研究人员的挑战,甚至可能更快地成为企业家宝贵信息的来源。现在,我们有社交网络中非正式友谊关系的详细记录,在电子商务站点上的购买,从一个用户发送到另一用户的各种信息,网络书签的在线集合以及许多其他数据集,这些数据集使我们能够提出感兴趣的问题无论从学术角度还是商业角度。例如,您可能想与社交网络的其他哪些用户成为朋友?您可能还想购买哪些其他商品?谁是网络中最有影响力的用户?您接下来可能要访问哪个网页?所有这些问题本身不仅很有趣,而且对他们的回答可能有助于企业家为客户提供更好的服务,并最终增加他们的利润。

著录项

  • 作者

    Matúš Medo;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"english","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号