期刊
MATHEMATICAL AND COMPUTER MODELLING
卷 52, 期 7-8, 页码 1052-1057出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2010.02.031
关键词
Google matrix; PageRank; Link analysis; Communication network; Social networking; Ranking algorithm
类别
资金
- Spanish DGI [MTM2007-64477]
In this paper a new method to classify the users of an SNS (Social Network Site) into groups is shown. The method is based on the PageRank algorithm. Competitivity groups are sets of nodes that compete among each other to gain PageRank via the personalization vector. Specific features of the SNSs (such as number of friends or activity of the users) can modify the ranking inside each Competitivity group. The concept of Leadership Group is also presented. Some numerical examples are shown. These concepts can also be applied to general complex networks. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据