Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
RelBAC: Relation Based Access Control
SKG '08 Proceedings of the 2008 Fourth International Conference on Semantics, Knowledge and Grid
A User-Activity-Centric Framework for Access Control in Online Social Networks
IEEE Internet Computing
ITHINGSCPSCOM '11 Proceedings of the 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing
Computer Science Review
Community Detection in Social Networks Using Information Diffusion
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.00 |
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.