Mining application-aware community organization with expanded feature subspaces from concerned attributes in social networks

Abstract Social networks are typical attributed networks with node attributes. Traditional attribute community detection problems aim at obtaining the whole set of communities in the network. Different from them, we study an application-oriented problem of mining an application-aware community organization with respect to a set of specific concerned attributes. The set of concerned attributes is provided based on the requirements of any application by a user in advance. The application-aware community organization w.r.t. the set of concerned attributes consists of the communities whose attribute subspaces contain such set of concerned attributes. Besides concerned attributes, the subspace of each required community may contain some other relevant attributes. All relevant attributes of a subspace jointly describe and determine the community embedded in such subspace. Thus the problem includes two subproblems, i.e., how to expand the set of concerned attributes to complete subspaces and how to mine the communities embedded in the expanded subspaces. Two subproblems are jointly solved by optimizing a quality function called subspace fitness. An algorithm called ACM is proposed. In order to locate the communities potentially belonging to the application-aware community organization, a network backbone composed of nodes with similar concerned attributes is constructed. Then the cohesive parts of the network backbone are detected and set as the community seeds to locate the required communities. The set of concerned attributes is set as the initial subspace for all communities. Then each community and its attribute subspace are adjusted iteratively to optimize the subspace fitness. Extensive experiments on synthetic datasets demonstrate the effectiveness and efficiency of our method and applications on real-world networks show its application values.

[1]  Dongxiao He,et al.  Autonomous overlapping community detection in temporal networks: A dynamic Bayesian nonnegative matrix factorization approach , 2016, Knowl. Based Syst..

[2]  Li Pan,et al.  Multi-objective community detection method by integrating users' behavior attributes , 2016, Neurocomputing.

[3]  Aditya Johri,et al.  Finding Community Topics and Membership in Graphs , 2015, ECML/PKDD.

[4]  Srinivasan Parthasarathy,et al.  Efficient community detection in large networks using content and links , 2012, WWW.

[5]  Hadi Zare,et al.  IEDC: An integrated approach for overlapping and non-overlapping community detection , 2016, Knowl. Based Syst..

[6]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Peng Wu,et al.  Multi-Objective Community Detection Based on Memetic Algorithm , 2015, PloS one.

[8]  Thomas Seidl,et al.  GAMer: a synthesis of subspace clustering and dense subgraph mining , 2013, Knowledge and Information Systems.

[9]  Zhen Wang,et al.  Community Detection Based on Structure and Content: A Content Propagation Perspective , 2015, 2015 IEEE International Conference on Data Mining.

[10]  Tang Jinhui,et al.  Overlapping community detection based on node location analysis , 2016 .

[11]  Hong Cheng,et al.  A model-based approach to attributed graph clustering , 2012, SIGMOD Conference.

[12]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[13]  Christos Faloutsos,et al.  PICS: Parameter-free Identification of Cohesive Subgroups in Large Attributed Graphs , 2012, SDM.

[14]  Hong Cheng,et al.  Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.

[15]  Martin Ester,et al.  Mining Cohesive Patterns from Graphs with Feature Vectors , 2009, SDM.

[16]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[18]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[19]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[20]  Francesco Folino,et al.  An Evolutionary Multiobjective Approach for Community Discovery in Dynamic Networks , 2014, IEEE Transactions on Knowledge and Data Engineering.

[21]  GabrysBogdan,et al.  Autonomous overlapping community detection in temporal networks , 2016 .

[22]  Boleslaw K. Szymanski,et al.  Community Detection via Maximization of Modularity and Its Variants , 2014, IEEE Transactions on Computational Social Systems.

[23]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[25]  Marc G. Genton,et al.  Classes of Kernels for Machine Learning: A Statistics Perspective , 2002, J. Mach. Learn. Res..

[26]  Emmanuel Müller,et al.  Focused clustering and outlier detection in large attributed graphs , 2014, KDD.

[27]  Jure Leskovec,et al.  Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.

[28]  Shazia Wasim Sadiq,et al.  Discovering interpretable geo-social communities for user behavior prediction , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[29]  Hong Cheng,et al.  Clustering large attributed information networks: an efficient incremental computing approach , 2012, Data Mining and Knowledge Discovery.

[30]  Martin Atzmüller,et al.  Description-oriented community detection using exhaustive subgroup discovery , 2016, Inf. Sci..

[31]  Thomas Seidl,et al.  Spectral Subspace Clustering for Graphs with Feature Vectors , 2013, 2013 IEEE 13th International Conference on Data Mining.

[32]  Hong Cheng,et al.  GBAGC: A General Bayesian Framework for Attributed Graph Clustering , 2014, TKDD.

[33]  L. D. Dhinesh Babu,et al.  A fuzzy adaptive resonance theory inspired overlapping community detection method for online social networks , 2016, Knowl. Based Syst..

[34]  Fang Liu,et al.  Prediction of missing links based on community relevance and ruler inference , 2016, Knowl. Based Syst..

[35]  Hong Cheng,et al.  Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities , 2011, TKDD.

[36]  Aristides Gionis,et al.  Overlapping community detection in labeled graphs , 2014, Data Mining and Knowledge Discovery.

[37]  Francesco Bonchi,et al.  Description-Driven Community Detection , 2014, TIST.

[38]  Hong Cheng,et al.  Dense community detection in multi-valued attributed networks , 2015, Inf. Sci..

[39]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[40]  Mohammed J. Zaki,et al.  Mining Attribute-structure Correlated Patterns in Large Attributed Graphs , 2012, Proc. VLDB Endow..