Nepotistic relationships in Twitter and their impact on rank prestige algorithms

Abstract

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.

DOI: 10.1016/j.ipm.2013.06.003

Extracted Key Phrases

26 Figures and Tables

Cite this paper

@article{GayoAvello2013NepotisticRI, title={Nepotistic relationships in Twitter and their impact on rank prestige algorithms}, author={Daniel Gayo-Avello}, journal={Inf. Process. Manage.}, year={2013}, volume={49}, pages={1250-1280} }