Overlapping community detection in heterogeneous social networks via the user model

Abstract Clustering users with more common interests who interact frequently on social networking sites has attracted much attention from researchers due to the high economic value and further application prospects. Community detection is a widely accepted means of dealing with the challenge of clustering users, but conventional methods are inadequate since there are billions of vertices and various relations in social media. Through the user model, a heterogeneous network containing both undirected and directed edges is built in this study to exactly simulate a social network. A novel approach for overlapping community detection in a heterogeneous social network (OCD-HSN) is proposed, which contains seed selecting and community initializing and expanding to accurately and efficiently unfold modules in parallel. Experimental results on artificial and real-world social networks demonstrate the higher accuracy and lower time consumption of the proposed scheme compared with other existing state-of-the-art algorithms.

[1]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[2]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

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

[4]  A. Pentland,et al.  Computational Social Science , 2009, Science.

[5]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[6]  Kamal Kant Bharadwaj,et al.  A collaborative filtering framework for friends recommendation in social networks based on interaction intensity and adaptive user similarity , 2012, Social Network Analysis and Mining.

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

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

[9]  L. Collins,et al.  Omega: A General Formulation of the Rand Index of Cluster Recovery Suitable for Non-disjoint Solutions. , 1988, Multivariate behavioral research.

[10]  Barry Smyth,et al.  Mining the real-time web: A novel approach to product recommendation , 2012, Knowl. Based Syst..

[11]  Jianhua Ma,et al.  Neighborhood-user profiling based on perception relationship in the micro-blog scenario , 2015, J. Web Semant..

[12]  Gourab Ghoshal,et al.  Social system as complex networks , 2014, Social Network Analysis and Mining.

[13]  A. Arenas,et al.  Synchronization processes in complex networks , 2006, nlin/0610057.

[14]  Bofeng Zhang,et al.  Overlapping Community Detection in social network based on Microblog User Model , 2014, 2014 International Conference on Data Science and Advanced Analytics (DSAA).

[15]  Robin Palotai,et al.  Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics , 2009, PloS one.

[16]  Zhang Ze.  Detecting Overlapping Communities with Heuristic Expansion Method Based on Rough Neighborhood , 2013 .

[17]  Gabriella Pasi,et al.  Personal ontologies: Generation of user profiles based on the YAGO ontology , 2013, Inf. Process. Manag..

[18]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.

[20]  Hideo Miyahara,et al.  A Community-Based Recommendation System to Reveal Unexpected Interests , 2005, 11th International Multimedia Modelling Conference.

[21]  Johan A. K. Suykens,et al.  Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks , 2014, PloS one.

[22]  John Riedl,et al.  Analysis of recommendation algorithms for e-commerce , 2000, EC '00.

[23]  Alex Arenas,et al.  Synchronization reveals topological scales in complex networks. , 2006, Physical review letters.

[24]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[25]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[26]  Luxu Zhang,et al.  Method of Recommend Microblogging Based on User Model , 2012, 2012 IEEE 12th International Conference on Computer and Information Technology.

[27]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[28]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2009, ACM Trans. Knowl. Discov. Data.

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

[30]  David F. Gleich,et al.  Vertex neighborhoods, low conductance cuts, and good seeds for local community methods , 2012, KDD.

[31]  Jin Qian,et al.  Detecting Overlapping Communities with Heuristic Expansion Method Based on Rough Neighborhood: Detecting Overlapping Communities with Heuristic Expansion Method Based on Rough Neighborhood , 2014 .

[32]  Teruo Higashino,et al.  Twitter user profiling based on text and community mining for market analysis , 2013, Knowl. Based Syst..