Nepotistic relationships in Twitter and their impact on rank prestige algorithms

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 use

Promoter Account Detection in Twitter

Twitter is an online social network and micro-blog that becomes an alternative media for sharing and getting information. In the political area, Twitter provides various features as a media to promote campaign and get a good imaging for political party or contestant. In order to get a good opinion from other users, the contestant can manipulate their success with a massive promotion. This promotion activity could lead to public opinion that is not consistent with the facts. So that, we need to determine whether this is promoter account or not. In this paper, we propose a new framework for promoter account detection. This framework based on twitter content to detect promoter account according to their existence in topic of promotion. This framework employs k-means approach in order to cluster topic of promotion based on twitter\u27s content. From each cluster, we evaluate the existence of promoter account. With very simple approach, the results obtained on experiment show that this framework is effective for promoter account detection

All liaisons are dangerous when all your friends are known to us

Online Social Networks (OSNs) are used by millions of users worldwide. Academically speaking, there is little doubt about the usefulness of demographic studies conducted on OSNs and, hence, methods to label unknown users from small labeled samples are very useful. However, from the general public point of view, this can be a serious privacy concern. Thus, both topics are tackled in this paper: First, a new algorithm to perform user profiling in social networks is described, and its performance is reported and discussed. Secondly, the experiments --conducted on information usually considered sensitive-- reveal that by just publicizing one's contacts privacy is at risk and, thus, measures to minimize privacy leaks due to social graph data mining are outlined.Comment: 10 pages, 5 table

De retibus socialibus et legibus momenti

Online Social Networks (OSNs) are a cutting edge topic. Almost everybody --users, marketers, brands, companies, and researchers-- is approaching OSNs to better understand them and take advantage of their benefits. Maybe one of the key concepts underlying OSNs is that of influence which is highly related, although not entirely identical, to those of popularity and centrality. Influence is, according to Merriam-Webster, "the capacity of causing an effect in indirect or intangible ways". Hence, in the context of OSNs, it has been proposed to analyze the clicks received by promoted URLs in order to check for any positive correlation between the number of visits and different "influence" scores. Such an evaluation methodology is used in this paper to compare a number of those techniques with a new method firstly described here. That new method is a simple and rather elegant solution which tackles with influence in OSNs by applying a physical metaphor.Comment: Changes made for third revision: Brief description of the dataset employed added to Introduction. Minor changes to the description of preparation of the bit.ly datasets. Minor changes to the captions of Tables 1 and 3. Brief addition in the Conclusions section (future line of work added). Added references 16 and 18. Some typos and grammar polishe

PROMOTER ACCOUNT DETECTION IN TWITTER

Twitter is an online social network and micro-blog that becomes an alternative media for sharing and getting information. In the political area, Twitter provides various features as a media to promote campaign and get a good imaging for political party or contestant. In order to get a good opinion from other users, the contestant can manipulate their success with a massive promotion. This promotion activity could lead to public opinion that is not consistent with the facts. So that, we need to determine whether this is promoter account or not. In this paper, we propose a new framework for promoter account detection. This framework based on twitter content to detect promoter account according to their existence in topic of promotion. This framework employs k-means approach in order to cluster topic of promotion based on twitter’s content. From each cluster, we evaluate the existence of promoter account. With very simple approach, the results obtained on experiment show that this framework is effective for promoter account detection

Leaders in Social Networks, the Delicious Case

Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced by choosing suitable leaders. For instance in delicious.com, users subscribe to leaders' collection which lead to a deeper and wider reach not achievable with search engines. To consolidate such collective search, it is essential to utilize the leadership topology and identify influential users. Google's PageRank, as a successful search algorithm in the World Wide Web, turns out to be less effective in networks of people. We thus devise an adaptive and parameter-free algorithm, the LeaderRank, to quantify user influence. We show that LeaderRank outperforms PageRank in terms of ranking effectiveness, as well as robustness against manipulations and noisy data. These results suggest that leaders who are aware of their clout may reinforce the development of social networks, and thus the power of collective search