Computer Science – Information Retrieval
Scientific paper
2010-04-06
Computer Science
Information Retrieval
31 pages, 16 tables, 12 figures.
Scientific paper
Micro-blogging services such as Twitter allow anyone to publish anything, anytime. Nonetheless 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.
No associations
LandOfFree
Nepotistic Relationships in Twitter and their Impact on Rank Prestige Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nepotistic Relationships in Twitter and their Impact on Rank Prestige Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nepotistic Relationships in Twitter and their Impact on Rank Prestige Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-57148