Finding overlapping communities in a complex network of social linkages and Internet of things

Online social networks play an important role in today’s Internet. These social networks contain huge amounts of data and the integrated framework of SN with Internet of things (IoT) presents a challenging problem. IoT is the ubiquitous interconnection of everyday items of interest (things), providing connectivity anytime, anywhere, and with anything. Like biological, co-authorship, and virus-spread networks, IoT and Social Network (SN) can be characterized to be complex networks containing substantial useful information. In the past few years, community detection in graphs has been an active area of research (Lee and Won in Proceedings of IEEE SoutheastCon, pp. 1–5, 2012). Many graph mining algorithms have been proposed, but none of them can help in capturing an important dimension of SNs, which is friendship. A friend circle expands with the help of mutual friends, and, thus, mutual friends play an important role in social networks’ growth. We propose two graph clustering algorithms: one for undirected graphs such as Facebook and Google+, and the other for directed graphs such as Twitter. The algorithms extract communities, and based on the access control policy nodes share resources (things). In the proposed Community Detection in Integrated IoT and SN (CDIISN) algorithm, we divide the nodes/actors of complex networks into basic, and IoT nodes. We, then, execute the community detection algorithm on them. We take nodes of a graph as members of a SN, and edges depicting the relations between the nodes. The CDIISN algorithm is purely deterministic, and no fuzzy communities are formed. It is known that one community detection algorithm is not suitable for all types of networks. For different network structures, different algorithms exhibit different results, and methods of execution. However, in our proposed method, the community detection algorithm can be modified as desired by a user based on the network connections. The proposed community detection approach is unique in the sense that a user can define his community detection criteria based on the kind of network.

[1]  Nam P. Nguyen,et al.  Overlapping Community Structures and Their Detection on Social Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[2]  P. Venkata Krishna,et al.  A Learning Automata Based Solution for Preventing Distributed Denial of Service in Internet of Things , 2011, 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing.

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

[4]  Role Based Access Control for social network sites , 2009, 2009 Joint Conferences on Pervasive Computing (JCPC).

[5]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[6]  Weiyi Liu,et al.  A dynamic algorithm for community detection in social networks , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

[7]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Wang Huan,et al.  Studying on internet of things based on fingerprint identification , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

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

[10]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[11]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[12]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[13]  T. Aushev,et al.  Study of B-→D**0π-(D**0→D(*)+π-) decays , 2004 .

[14]  Lars Backstrom,et al.  The Anatomy of the Facebook Social Graph , 2011, ArXiv.

[15]  Fausto Giunchiglia,et al.  RelBAC: Relation Based Access Control , 2008, 2008 Fourth International Conference on Semantics, Knowledge and Grid.

[16]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[17]  P. Venkata Krishna,et al.  An adaptive learning approach for fault-tolerant routing in Internet of Things , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[18]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[19]  Hamidreza Alvari,et al.  Community Detection in Social Networks Using Information Diffusion , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[20]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[21]  Hans-Peter Kriegel,et al.  Density-based community detection in social networks , 2011, 2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application.

[22]  Byung-Won On,et al.  Community detection for large scale social network sites , 2012, 2012 Proceedings of IEEE Southeastcon.

[23]  Yuan Cheng,et al.  A User-Activity-Centric Framework for Access Control in Online Social Networks , 2011, IEEE Internet Computing.