首页> 外文OA文献 >Network-aware recommendations in online social networks
【2h】

Network-aware recommendations in online social networks

机译:在线社交网络中的网络感知建议

摘要

Along with the rapid increase of using social networks sites such as Twitter, a massive number of tweets published every day which generally affect the users decision to forward what they receive of information, and result in making them feel overwhelmed with this information. Then, it is important for this services to help the users not lose their focus from what is close to their interests, and to find potentially interesting tweets. The problem that can occur in this case is called information overload, where an individual will encounter too much information in a short time period. For instance, in Twitter, the user can see a large number of tweets posted by her followees. To sort out this issue, recommender systems are used to give contents that match the user's needs.udududThis thesis presents a tweet-recommendation approach aiming at proposing novel tweets to users and achieving improvement over baseline. For this reason, we propose to exploit network, content, and retweet analyses for making recommendations of tweets.ududThe main objective of this research is to recommend tweets thatudare unseen by the user (i.e., they do not appear in the user timeline) because nobody in her social circles published or retweetedudthem. To achieve this goal, we create the user's ego-network up to depth two and apply theudtransitivity property of the emph{friends-of-friends} relationship to determine interesting recommendations. After this step, we apply cosine similarity and Jaccard distance as similarity measures for the candidate tweets obtained from the network analysis using bigrams. We also count the mutual retweets between the ego user and candidate users as a measure of shared similar tastes. The values of these features are compared together for each of the candidate tweets using pairwise comparisons in order to determine interesting recommendations that are ranked to best match the user's interests.ududExperimental results demonstrate through a real user study that our approachudimproves the state-of-the-art technique. In addition to the efficiency of our approach in finding relevant contents, it is also characterized by the fact of providing novel tweets, which solves the over-specialization challenge or serendipity problem that appears when using content-based recommender systems as a stand alone approach of recommendation.
机译:随着使用诸如Twitter之类的社交网站的迅速增加,每天发布大量推文,这些推文通常会影响用户决定转发他们收到的信息的决定,并导致他们对此信息感到不知所措。然后,对于这项服务来说,重要的是要帮助用户不要因为他们的兴趣爱好而失去他们的注意力,并找到潜在的有趣推文。在这种情况下可能发生的问题称为信息过载,其中个人将在短时间内遇到太多信息。例如,在Twitter中,用户可以看到其关注者发布的大量推文。为了解决这个问题,推荐系统用于提供符合用户需求的内容。 ud ud ud本论文提出了一种推文推荐方法,旨在向用户提出新颖的推文并实现对基线的改进。出于这个原因,我们建议利用网络,内容和转推分析来建议推文。 ud ud本研究的主要目的是推荐用户不敢看到的推文(即,它们不会出现在用户时间轴),因为她的社交圈中没有人发布或转发过 udthem。为了实现这个目标,我们创建了用户的自我网络,深度达到第二层,并应用 emph {friends-of-friends}关系的 udtransitivity属性来确定有趣的建议。在此步骤之后,我们将余弦相似度和Jaccard距离作为相似度的度量,用于使用bigrams从网络分析中获得的候选推文。我们还将自我用户和候选用户之间的相互转发视为共享相似喜好的度量。 ,,,,,, 、、、、、、、、、、、最先进的技术。除了我们的方法在查找相关内容方面的效率外,它还具有提供新颖的推文这一事实,该推文解决了将基于内容的推荐系统用作独立的推荐方法时出现的过度专业化挑战或偶然性问题。建议。

著录项

  • 作者

    Alawad NOOR ALDEEN KAMEL;

  • 作者单位
  • 年度 2017
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号