A Novel Trust Model Based Overlapping Community Detection Algorithm for Social Networks

With the fast advances in Internet technologies, social networks have become a major platform for social interaction, lifestyle demonstration, and message dissemination. Effective community detection in social networks helps to assess public sentiment, identify community leaders, and produce personalized recommendation. While different community detection approaches have been proposed in the literature, the trust model based detection schemes model user interactions as trust transfer, which helps to capture the implicit relation in the network. Unfortunately, trust model based detection schemes face a cold start problem, i.e., they cannot accurately model newly joined users as these users have few interactions for a duration after joining the network. In this paper, we propose TLCDA, a novel trust model based community detection algorithm. By enhancing the traditional trust computation with inter-node relation strength and similarity in social networks, TLCDA detects communities through coarse-grained K-Mediods clustering. Our evaluation on real social networks shows that the communities detected by TLCDA exhibit superior preference cohesion while satisfying the topology cohesion.

[1]  Jose M. Such,et al.  BFF: A tool for eliciting tie strength and user communities in social networking services , 2013, Information Systems Frontiers.

[2]  Fan Zhang,et al.  Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem , 2017, AAAI.

[3]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[4]  Xin Yu,et al.  A semantic overlapping community detection algorithm based on field sampling , 2015, Expert Syst. Appl..

[5]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6]  Hristo Djidjev,et al.  Scalable and Accurate Graph Clustering and Community Structure Detection , 2013, IEEE Transactions on Parallel and Distributed Systems.

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

[8]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[9]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

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

[11]  Ling Liu,et al.  PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities , 2004, IEEE Transactions on Knowledge and Data Engineering.

[12]  Audun Jøsang,et al.  Integrating Trust with Public Reputation in Location-Based Social Networks for Recommendation Making , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[13]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[14]  Chien Chin Chen,et al.  An effective recommendation method for cold start new users using trust and distrust networks , 2013, Inf. Sci..

[15]  N. Latha,et al.  Personalized Recommendation Combining User Interest and Social Circle , 2015 .

[16]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Xiaowei Xu,et al.  Investigating Homophily in Online Social Networks , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

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

[19]  Jose M. Such,et al.  IMPROVE - Identifying Minimal PROfile VEctors for Similarity Based Access Control , 2016, 2016 IEEE Trustcom/BigDataSE/ISPA.

[20]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[21]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Hayder Radha,et al.  Cold-Start Recommendation with Provable Guarantees: A Decoupled Approach , 2016, IEEE Transactions on Knowledge and Data Engineering.

[23]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[24]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[25]  Francisco Chiclana,et al.  A social network analysis trust-consensus based approach to group decision-making problems with interval-valued fuzzy reciprocal preference relations , 2014, Knowl. Based Syst..

[26]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

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

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

[29]  James A. Hendler,et al.  Inferring binary trust relationships in Web-based social networks , 2006, TOIT.

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

[31]  Yang Lu,et al.  Community Discovery Based on Social Actors' Interests and Social Relationships , 2008, 2008 Fourth International Conference on Semantics, Knowledge and Grid.

[32]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[34]  Kristen LeFevre,et al.  Privacy wizards for social networking sites , 2010, WWW '10.

[35]  Thomas L. Griffiths,et al.  Probabilistic author-topic models for information discovery , 2004, KDD.

[36]  Linyuan Lu,et al.  A general and effective diffusion-based recommendation scheme on coupled social networks , 2017, Inf. Sci..

[37]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[38]  Stanford,et al.  Learning to Discover Social Circles in Ego Networks , 2012 .

[39]  Shuliang Wang,et al.  Data Field for Hierarchical Clustering , 2011, Int. J. Data Warehous. Min..

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

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

[42]  Cecile Paris,et al.  STrust: A Trust Model for Social Networks , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[43]  Neil Yorke-Smith,et al.  A Novel Recommendation Model Regularized with User Trust and Item Ratings , 2016, IEEE Transactions on Knowledge and Data Engineering.

[44]  Zhaohui Wu,et al.  On Deep Learning for Trust-Aware Recommendations in Social Networks , 2017, IEEE Transactions on Neural Networks and Learning Systems.

[45]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[46]  Ulises Cortés,et al.  Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm , 2017, COMPLEX NETWORKS.

[47]  Daniel Dajun Zeng,et al.  User community discovery from multi-relational networks , 2013, Decis. Support Syst..

[48]  Andrew McCallum,et al.  Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email , 2007, J. Artif. Intell. Res..

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

[50]  A. Banerjee,et al.  Social Topic Models for Community Extraction , 2008 .