Mining tribe-leaders based on the frequent pattern of propagation

  • Authors:

  • Zhaoyun Ding;Yan Jia;Bin Zhou;Yi Han

  • Affiliations:

  • School of Computers, National University of Defense Technology, Changsha, China;School of Computers, National University of Defense Technology, Changsha, China;School of Computers, National University of Defense Technology, Changsha, China;School of Computers, National University of Defense Technology, Changsha, China

  • Venue:
  • APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the rapid development of new social networks, such as blog, forum, microblog, etc, the publication and propagation of information become more convenient, and the interactions of users become more active and frequent. Discovering the influencers in the new social network is very important for the promotion of products and the supervision of public opinion. Most of the previous research was based on the method of mining influential individuals, while the tribe-leaders were neglected. In this paper, a new method of mining tribe-leaders is proposed based on the frequent pattern of propagation. First, a method of changing the diffusion trees is proposed to overcome the problem of multi-pattern in propagation, where the information propagation trees are changed into a connected undirected acyclic graph. Then, a new frequent subgraph mining method called Tribe-FGM is proposed to improve the efficiency of graph mining by reducing the scale of pattern growth. Experiments are conducted on a real dataset, and the results show that Tribe-FGM is more effective than the method of Unot. Finally, we validate the effectiveness of our method by comparing it with the repost algorithms, where the experimental results indicate that the tribe-leaders with our method are consistently better than that of repost algorithms in both the one-step and multi-step coverage.