A new algorithm for communities detection in social networks with node attributes

Revealing the community structure in social networks witnessed a determined effort. In this respect, a different category of social network can be handled, such as, dynamic social networks, social networks with node attributes, etc. In this article, we introduce a new method to solve this thriving issue in the social network with node attributes. This latter can be represented by a bipartite graph, which consists of a two sets of nodes and edges connecting these nodes. The tendency of people with similar node attributes leads to the hidden information of clusters or communities. A wealthy number of community-detection algorithms have been proposed for bipartite graphs and applied to several domains in the literature. To palliate some of the highlighted shortcomings, we introduce a new approach, called Fast-Bi Community Detection (FBCD), that aims to an efficient community detection in social networks. The main idea of this approach is to explore the set of maximum matching in the bipartite graph in order to reduce the complexity of our algorithm. The carried out experiments show the high quality of the obtained communities versus those by the pioneering ones of the literature.

[1]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[2]  Tao Dai,et al.  Explore semantic topics and author communities for citation recommendation in bipartite bibliographic network , 2017, Journal of Ambient Intelligence and Humanized Computing.

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

[4]  Hiroki Arimura,et al.  LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining , 2005 .

[5]  Camille Roth,et al.  Towards Concise Representation for Taxonomies of Epistemic Communities , 2006, CLA.

[6]  Matthieu Latapy,et al.  Identifying roles in an IP network with temporal and structural density , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[7]  Dino Pedreschi,et al.  DEMON: a local-first discovery method for overlapping communities , 2012, KDD.

[8]  R. Häggkvist,et al.  Bipartite graphs and their applications , 1998 .

[9]  M. Barber.  Modularity and community detection in bipartite networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Roger Guimerà,et al.  Module identification in bipartite and directed networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Edward Omiecinski,et al.  Alternative Interest Measures for Mining Associations in Databases , 2003, IEEE Trans. Knowl. Data Eng..

[15]  Hiroki Arimura,et al.  An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases , 2004, Discovery Science.

[16]  Tsuyoshi Murata,et al.  Community Division of Heterogeneous Networks , 2009, Complex.

[17]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[18]  Changjie Tang,et al.  An MDL approach to efficiently discover communities in bipartite network , 2010, Journal of Central South University.

[19]  Ching-Lai Hwang,et al.  Multiple Attribute Decision Making: Methods and Applications - A State-of-the-Art Survey , 1981, Lecture Notes in Economics and Mathematical Systems.

[20]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[21]  Sadok Ben Yahia,et al.  QualityCover: Efficient binary relation coverage guided by induced knowledge quality , 2016, Inf. Sci..

[22]  Jason J. Jung,et al.  ACO-based clustering for Ego Network analysis , 2017, Future Gener. Comput. Syst..

[23]  Sadok Ben Yahia,et al.  On the efficient stability computation for the selection of interesting formal concepts , 2019, Inf. Sci..

[24]  Engelbert Mephu Nguifo,et al.  Approches d'extraction de règles d'association basées sur la correspondance de Galois , 2004, Ingénierie des Systèmes d Inf..

[25]  Ching-Lai Hwang,et al.  A new approach for multiple objective decision making , 1993, Comput. Oper. Res..

[26]  Stelios H. Zanakis,et al.  Multi-attribute decision making: A simulation comparison of select methods , 1998, Eur. J. Oper. Res..

[27]  Burleigh B. Gardner,et al.  Deep South: A Social Anthropological Study of Caste and Class , 1942 .

[28]  Jure Leskovec,et al.  Community-Affiliation Graph Model for Overlapping Network Community Detection , 2012, 2012 IEEE 12th International Conference on Data Mining.

[29]  Ching-Lai Hwang,et al.  Fuzzy Multiple Attribute Decision Making - Methods and Applications , 1992, Lecture Notes in Economics and Mathematical Systems.

[30]  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.

[31]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[32]  Sadok Ben Yahia,et al.  Scalable computation of the extensional and intensional stability of formal concepts , 2018, Int. J. Gen. Syst..

[33]  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.

[34]  Engelbert Mephu Nguifo,et al.  Succinct Minimal Generators: Theoretical Foundations and Applications , 2008, Int. J. Found. Comput. Sci..

[35]  Sadok Ben Yahia,et al.  Efficient unveiling of multi-members in a social network , 2014, J. Syst. Softw..

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