Detecting communities in online social networks
نویسندگان
چکیده
A community can be defined as a subset of the users in a social network that is more tightly interconnected than the overall network. Communities are useful, for instance, to guide information dissemination and acquisition, to recommend or introduce people who would likely benefit from direct interaction, and to express access control policies. In this paper, we study algorithms for automatically detecting communities in a social network. Using data from a university social network, we show that individual users are typically part of several communities, such as communities based on dormitory, matriculation year, or department. We show that existing algorithms for detecting communities associate each user with only one of the relevant communities and, consequently, fail to detect the multiple communities that exist in the network. Finally, we present and evaluate a new algorithm that can detect a specific community in the social network with high accuracy when given a small subset of the users in that community.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملDetecting Communities from Social Tagging Networks Based on Tripartite Modularity
Online social media such as delicious and digg are represented as tripartite networks whose vertices are users, tags, and resources. Detecting communities from such tripartite networks is practically important. Newman-Girvan modularity is often used as the criteria for evaluating the goodness of network divisions into communities. Murata has extended Newman-Girvan modularity in order to evaluat...
متن کاملDetecting Overlapping Communities in Social Networks by Game Theory and Structural Equivalence Concept
Most complex networks demonstrate a significant property ‘community structure’, meaning that the network nodes are often joined together in tightly knit groups or communities, while there are only looser connections between them. Detecting these groups is of great importance and has immediate applications, especially in the popular online social networks like Facebook and Twitter. Many of these...
متن کاملThree Facets of Online Political Networks: Communities, Antagonisms and Controversial Issues
Without any doubt, for the last decade, online social networks have been hubs for political participation both for elite members such as politicians, parliamentary members, and ordinary citizens. Each online activity leaves digital traces of the users participating which enable researchers to study online political behavior and build multi-faceted sensors to understand the underlying dynamics. ...
متن کاملA New Framework based on Learning Automata for User Community Detection in Social Networks
Recently, social networks provide some rich resources of heterogeneous data which their analysis can lead to discover unknown information and relations within such networks. Users in online social networks tend to form community groups based on common location, interests, occupation, etc. Hence, communities play special roles in the structure–function relationship. Therefore, detecting signific...
متن کامل