Attributed Community Analysis: Global and Ego-centric Views

The proliferation of rich information available for real world entities and their relationships gives rise to a type of graph, namely attributed graph, where graph vertices are associated with a number of attributes. The set of an attribute can be formed by a series of keywords. In attributed graphs, it is practically useful to discover communities of densely connected components with homogeneous attribute values. In terms of different aspects, the community analysis tasks can be categorized into global network-wide and ego-centric personalized. The global network-wide community analysis considers the entire network, such that community detection, which is to find all communities in a network. On the other hand, the ego-centric personalized community analysis focuses on the local neighborhood subgraph of given query nodes, such that community search. Given a set of query nodes and attributes, community search in attributed graphs is to locally detect meaningful community containing queryrelated nodes in the online manner. In this work, we briefly survey several state-of-the-art community models based on various dense subgraphs, meanwhile also investigate social circles, that one special kind of communities are formed by friends in 1-hop neighborhood network for a particular user.

[1]  Laks V. S. Lakshmanan,et al.  Approximate Closest Community Search in Networks , 2015, Proc. VLDB Endow..

[2]  Nicola Barbieri,et al.  Efficient and effective community search , 2015, Data Mining and Knowledge Discovery.

[3]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Yu Wang,et al.  An Edge-based Clustering Algorithm to Detect Social Circles in Ego Networks , 2013, J. Comput..

[5]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[6]  Hong Cheng,et al.  Top-K structural diversity search in large networks , 2013, The VLDB Journal.

[7]  Haixun Wang,et al.  Online search of overlapping communities , 2013, SIGMOD '13.

[8]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[9]  Aristides Gionis,et al.  The community-search problem and how to plan a successful cocktail party , 2010, KDD.

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

[11]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[12]  Haixun Wang,et al.  Local search of communities in large graphs , 2014, SIGMOD Conference.

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

[14]  Aijun An,et al.  Discovering top-k teams of experts with/without a leader in social networks , 2011, CIKM '11.

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

[16]  Atish Das Sarma,et al.  Multi-skill Collaborative Teams based on Densest Subgraphs , 2011, SDM.

[17]  Jeffrey Xu Yu,et al.  Influential Community Search in Large Networks , 2015, Proc. VLDB Endow..

[18]  Lars Backstrom,et al.  Structural diversity in social contagion , 2012, Proceedings of the National Academy of Sciences.

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

[20]  Jing Li,et al.  Robust Local Community Detection: On Free Rider Effect and Its Elimination , 2015, Proc. VLDB Endow..

[21]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[22]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[23]  Jeffrey Xu Yu,et al.  Querying k-truss community in large and dynamic graphs , 2014, SIGMOD Conference.