Feature identification for predicting community evolution in dynamic social networks

被引:33
作者
Ilhan, Nagehan [1 ]
Oguducu, Sule Gunduz [1 ]
机构
[1] Istanbul Tech Univ, Fac Comp & Informat, Istanbul, Turkey
关键词
Dynamic networks; Community evolution; Feature selection; FEATURE-SELECTION; COMPLEX NETWORKS; CLASSIFICATION;
D O I
10.1016/j.engappai.2016.06.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In parallel with the increasing popularity of commercial social-networking systems, the scales of such systems have grown notably, now with sizes ranging from hundreds of millions to more than a billion users. Besides being large, these systems also have a dynamic, temporal nature, with evolving structures. Thus, one of the main challenges is to understand and model the evolution of the meso-scale structures such as community structures within these networks. Most previous studies have concentrated on determining community events based on the community features extracted at different time points. However, both the huge volume of data and the dynamic structure of the networks hinder effective computation of these features. In this paper, we propose a novel framework that examines various structural features of the network and detects the most prominent subset of community features in order to predict the future direction of community evolution. Our approach is to extract the network structure and use it to determine the subset of community features that leads to accurate community event prediction. Unlike traditional approaches that harvest a large number of features at each time point, the proposed framework requires extraction of a minimal number of community features to effectively determine whether a community will remain stable or undergo certain events such as shrink, merge or split. Moreover, the extracted community features vary depending on the network structure, capturing network specific characteristics. Several experiments conducted on four publicly available datasets verified the effectiveness of the proposed framework. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:202 / 218
页数:17
相关论文
共 71 条
  • [1] Ahn YY, 2007, WWW '07: Proceedings of the 16th international conference on World Wide Web, P835
  • [2] Exploring the limits of community detection strategies in complex networks
    Aldecoa, Rodrigo
    Marin, Ignacio
    [J]. SCIENTIFIC REPORTS, 2013, 3
  • [3] Surprise maximization reveals the community structure of complex networks
    Aldecoa, Rodrigo
    Marin, Ignacio
    [J]. SCIENTIFIC REPORTS, 2013, 3
  • [4] [Anonymous], ARXIV08044356
  • [5] [Anonymous], 2012, Proceedings of the Fifth ACM International Conference on Web Search and Data Mining (WSDM '12), Seattle, WA, DOI [DOI 10.1145/2124295.2124374, 10.1145/2124295.2124374]
  • [6] [Anonymous], 2006, P 12 ACM SIGKDD INT
  • [7] [Anonymous], 2006, Proceedings of 12th International Conference on Knowledge Discovery in Data Mining
  • [8] [Anonymous], 2008, P 17 INT C WORLD WID
  • [9] Asur S, 2007, KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P913
  • [10] Backstrom L., 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P44, DOI DOI 10.1145/1150402.1150412