Community Detection in Political Discussions on Twitter

2016 ◽  
Vol 35 (2) ◽  
pp. 244-261 ◽  
Author(s):  
Frederic Guerrero-Solé
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Reliable Method ◽  
Community Structures ◽  
Network Community ◽  
High Polarization

In November 9, 2014, the Catalan government called Catalan people to participate in a straw poll about the independence of Catalonia from Spain. This article analyzes the use of Twitter between November 8 and 10, 2014. Drawing on a methodology developed by Guerrero-Solé, Corominas-Murtra, and Lopez-Gonzalez, this work examines the structure of the retweet overlap network (RON), formed by those users whose communities of retweeters have nonzero overlapping, to detect the community structure of the network. The results show a high polarization of the resulting network and prove that the RON is a reliable method to determinate network community structures and users’ political leaning in political discussions.

scholarly journals Variational Approach for Learning Community Structures

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jun Jin Choong ◽  
Xin Liu ◽  
Tsuyoshi Murata
Keyword(s):  
Deep Learning ◽  
Community Structure ◽  
Learning Community ◽  
Community Detection ◽  
Representation Learning ◽  
Semisupervised Learning ◽  
Detection Methods ◽  
Community Structures ◽  
Learning Tasks ◽  
Proposed Model

Discovering and modeling community structure exist to be a fundamentally challenging task. In domains such as biology, chemistry, and physics, researchers often rely on community detection algorithms to uncover community structures from complex systems yet no unified definition of community structure exists. Furthermore, existing models tend to be oversimplified leading to a neglect of richer information such as nodal features. Coupled with the surge of user generated information on social networks, a demand for newer techniques beyond traditional approaches is inevitable. Deep learning techniques such as network representation learning have shown tremendous promise. More specifically, supervised and semisupervised learning tasks such as link prediction and node classification have achieved remarkable results. However, unsupervised learning tasks such as community detection remain widely unexplored. In this paper, a novel deep generative model for community detection is proposed. Extensive experiments show that the proposed model, empowered with Bayesian deep learning, can provide insights in terms of uncertainty and exploit nonlinearities which result in better performance in comparison to state-of-the-art community detection methods. Additionally, unlike traditional methods, the proposed model is community structure definition agnostic. Leveraging on low-dimensional embeddings of both network topology and feature similarity, it automatically learns the best model configuration for describing similarities in a community.

scholarly journals LIMITED RESOLUTION AND MULTIRESOLUTION METHODS IN COMPLEX NETWORK COMMUNITY DETECTION

2007 ◽  
Vol 07 (03) ◽  
pp. L209-L214 ◽  
Author(s):  
JUSSI M. KUMPULA ◽  
JARI SARAMÄKI ◽  
KIMMO KASKI ◽  
JÁNOS KERTÉSZ
Keyword(s):  
Simulated Annealing ◽  
Community Structure ◽  
Complex Network ◽  
Community Detection ◽  
Real World ◽  
Tuning Parameter ◽  
Challenging Problem ◽  
Resolution Limit ◽  
Network Community ◽  
Multiresolution Methods

Detecting community structure in real-world networks is a challenging problem. Recently, it has been shown that the resolution of methods based on optimizing a modularity measure or a corresponding energy is limited; communities with sizes below some threshold remain unresolved. One possibility to go around this problem is to vary the threshold by using a tuning parameter, and investigate the community structure at variable resolutions. Here, we analyze the resolution limit and multiresolution behavior for two different methods: a q-state Potts method proposed by Reichard and Bornholdt, and a recent multiresolution method by Arenas, Fernández, and Gómez. These methods are studied analytically, and applied to three test networks using simulated annealing.

scholarly journals Neighbor Similarity Based Agglomerative Method for Community Detection in Networks

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Jianjun Cheng ◽  
Xing Su ◽  
Haijuan Yang ◽  
Longjie Li ◽  
Jingming Zhang ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Second Phase ◽  
Community Structures ◽  
Node Similarity ◽  
Local Methods ◽  
Two Phases ◽  
Comparison Algorithms ◽  
New Community ◽  
The One

Community structures can reveal organizations and functional properties of complex networks; hence, detecting communities from networks is of great importance. With the surge of large networks in recent years, the efficiency of community detection is demanded critically. Therefore, many local methods have emerged. In this paper, we propose a node similarity based community detection method, which is also a local one consisted of two phases. In the first phase, we first take out the node with the largest degree from the network to take it as an exemplar of the first community and insert its most similar neighbor node into the community as well. Then, the one with the largest degree in the remainder nodes is selected; if its most similar neighbor has not been classified into any community yet, we create a new community for the selected node and its most similar neighbor. Otherwise, if its most similar neighbor has been classified into a certain community, we insert the selected node into the community to which its most similar neighbor belongs. This procedure is repeated until every node in the network is assigned to a community; at that time, we obtain a series of preliminary communities. However, some of them might be too small or too sparse; edges connecting to outside of them might go beyond the ones inside them. Keeping them as the final ones will lead to a low-quality community structure. Therefore, we merge some of them in an efficient approach in the second phase to improve the quality of the resulting community structure. To testify the performance of our proposed method, extensive experiments are performed on both some artificial networks and some real-world networks. The results show that the proposed method can detect high-quality community structures from networks steadily and efficiently and outperform the comparison algorithms significantly.

scholarly journals Effectively Detecting Communities by Adjusting Initial Structure via Cores

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-20
Author(s):  
Mei Chen ◽  
Zhichong Yang ◽  
Xiaofang Wen ◽  
Mingwei Leng ◽  
Mei Zhang ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Linear Time ◽  
Local Density ◽  
Ground Truth ◽  
Detection Algorithm ◽  
Initial Structure ◽  
Community Structures ◽  
Art Community ◽  
Community Detection Algorithm

Community detection is helpful to understand useful information in real-world networks by uncovering their natural structures. In this paper, we propose a simple but effective community detection algorithm, called ACC, which needs no heuristic search but has near-linear time complexity. ACC defines a novel similarity which is different from most common similarity definitions by considering not only common neighbors of two adjacent nodes but also their mutual exclusive degree. According to this similarity, ACC groups nodes together to obtain the initial community structure in the first step. In the second step, ACC adjusts the initial community structure according to cores discovered through a new local density which is defined as the influence of a node on its neighbors. The third step expands communities to yield the final community structure. To comprehensively demonstrate the performance of ACC, we compare it with seven representative state-of-the-art community detection algorithms, on small size networks with ground-truth community structures and relatively big-size networks without ground-truth community structures. Experimental results show that ACC outperforms the seven compared algorithms in most cases.

scholarly journals CDCN: A New NMF-Based Community Detection Method with Community Structures and Node Attributes

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhiwen Ye ◽  
Hui Zhang ◽  
Libo Feng ◽  
Zhangming Shan
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Network Topology ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Original Network ◽  
Community Structures ◽  
Structure Matrix ◽  
Node Attributes

Community discovery can discover the community structure in a network, and it provides consumers with personalized services and information pushing. It plays an important role in promoting the intelligence of the network society. Most community networks have a community structure whose vertices are gathered into groups which is significant for network data mining and identification. Existing community detection methods explore the original network topology, but they do not make the full use of the inherent semantic information on nodes, e.g., node attributes. To solve the problem, we explore networks by considering both the original network topology and inherent community structures. In this paper, we propose a novel nonnegative matrix factorization (NMF) model that is divided into two parts, the community structure matrix and the node attribute matrix, and we present a matrix updating method to deal with the nonnegative matrix factorization optimization problem. NMF can achieve large-scale multidimensional data reduction processing to discover the internal relationships between networks and find the degree of network association. The community structure matrix that we proposed provides more information about the network structure by considering the relationships between nodes that connect directly or share similar neighboring nodes. The use of node attributes provides a semantic interpretation for the community structure. We conduct experiments on attributed graph datasets with overlapping and nonoverlapping communities. The results of the experiments show that the performances of the F1-Score and Jaccard-Similarity in the overlapping community and the performances of normalized mutual information (NMI) and accuracy (AC) in the nonoverlapping community are significantly improved. Our proposed model achieves significant improvements in terms of its accuracy and relevance compared with the state-of-the-art approaches.

scholarly journals Label Propagation withα-Degree Neighborhood Impact for Network Community Detection

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Heli Sun ◽  
Jianbin Huang ◽  
Xiang Zhong ◽  
Ke Liu ◽  
Jianhua Zou ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Structure And Function ◽  
Label Propagation ◽  
Iterative Approach ◽  
Network Community ◽  
Weight Value ◽  
And Function ◽  
Node Labels ◽  
Better Than

Community detection is an important task for mining the structure and function of complex networks. In this paper, a novel label propagation approach withα-degree neighborhood impact is proposed for efficiently and effectively detecting communities in networks. Firstly, we calculate the neighborhood impact of each node in a network within the scope of itsα-degree neighborhood network by using an iterative approach. To mitigate the problems of visiting order correlation and convergence difficulty when updating the node labels asynchronously, our method updates the labels in an ascending order on theα-degree neighborhood impact of all the nodes. Theα-degree neighborhood impact is also taken as the updating weight value, where the parameter impact scopeαcan be set to a positive integer. Experimental results from several real-world and synthetic networks show that our method can reveal the community structure in networks rapidly and accurately. The performance of our method is better than other label propagation based methods.

scholarly journals Multiobjective Brain Storm Optimization Community Detection Method Based on Novelty Search

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xiaoying Pan ◽  
Jia Wang ◽  
Miao Wei ◽  
Hongye Li
Keyword(s):  
Community Structure ◽  
Complex Network ◽  
Community Detection ◽  
Detection Method ◽  
Premature Convergence ◽  
Practical Significance ◽  
Network Community ◽  
Brain Storm Optimization ◽  
Optimal Network ◽  
Novelty Search

A complex network is characterized by community structure, so it is of great theoretical and practical significance to discover hidden functions by detecting the community structure in complex networks. In this paper, a multiobjective brain storm optimization based on novelty search (MOBSO-NS) community detection method is proposed to solve the current issue of premature convergence caused by the loss of diversity in complex network community detection based on multiobjective optimization algorithm and improve the accuracy of community discovery. The proposed method designs a novel search strategy where novelty individuals are first constructed to improve the global search ability, thus avoiding falling into local optimal solutions; then, the objective space is divided into 3 clusters: elite cluster, ordinary cluster, and novel cluster, which are mapped to the decision space, and finally, the populations are disrupted and merged. In addition, the introduction of a restarting strategy is introduced to avoid stagnation by premature convergence. Experimental results show that the algorithm with good global searchability can find the Pareto optimal network community structure set with uniform distribution and high convergence and excavate the network community with higher quality.

Network Community Detection Based on Co-Neighbor Modularity Matrix with Spectral Clustering

2011 ◽  
Vol 55-57 ◽  
pp. 1237-1241
Author(s):  
Ji Liu ◽  
Lei Li
Keyword(s):  
Community Structure ◽  
Euclidean Space ◽  
Community Detection ◽  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Network Systems ◽  
Space Network ◽  
Network Community ◽  
Spectral Clustering Algorithm

The problem of community detection is one of the outstanding issues in the study of network systems. This paper presents co-neighbor modularity matrix to measure the quality of community detection. The problem of community detection is projected into clustering of eigenvectors in Euclidean space. Network community structure is detected with spectral clustering algorithm which is free from the noise of initial mean point in K-mean algorithm. The experimental results suggest that the method is efficient in finding the structure of community.

scholarly journals Modelling community structure and temporal spreading on complex networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Network Structure ◽  
Network Connectivity ◽  
Network Models ◽  
Building Blocks ◽  
Detection Algorithm ◽  
Research Area ◽  
Detection Methods

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.

Sign in / Sign up

Export Citation Format

Share Document