arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.0816cs.IR
收藏

Twitter中的裙带关系及其对排名声望算法的影响

Nepotistic Relationships in Twitter and their Impact on Rank Prestige Algorithms

Daniel Gayo-Avello

摘要:

Twitter等微博客服务允许任何人在任何时间发布任何内容。不用说,许多可用的内容可以减少为胡言乱语或垃圾邮件。然而,考虑到用户的数量和多样性,一些有价值的信息应该从推文流中产生。因此,只要有办法找到最相关/最值得信赖/最权威的用户,这种服务就可以发展成为最新信息的宝贵来源(所谓的实时网络)。因此,这使得一个高度相关的问题,图中心性方法可以提供答案。在本文中,作者提供了一个全面的调查可行的算法,在社交网络中的用户排名,他研究了他们的弱点,在这样的网络链接的弊端,并提出了一个客观的标准,对这些算法进行比较。此外,他建议第一步是对声望算法进行“脱敏”,以防止垃圾邮件发送者和其他滥用用户作弊。

英文摘要:

Micro-blogging services such as Twitter allow anyone to publish anything, anytime. Needless to say, many of the available contents can be diminished as babble or spam. However, given the number and diversity of users, some valuable pieces of information should arise from the stream of tweets. Thus, such services can develop into valuable sources of up-to-date information (the so-called real-time web) provided a way to find the most relevant/trustworthy/authoritative users is available. Hence, this makes a highly pertinent question for which graph centrality methods can provide an answer. In this paper the author offers a comprehensive survey of feasible algorithms for ranking users in social networks, he examines their vulnerabilities to linking malpractice in such networks, and suggests an objective criterion against which to compare such algorithms. Additionally, he suggests a first step towards "desensitizing" prestige algorithms against cheating by spammers and other abusive users.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑