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 An Improved Spectral Clustering Community Detection Algorithm Based on Probability Matrix

2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Shuxia Ren ◽  
Shubo Zhang ◽  
Tao Wu
Keyword(s):  
Community Detection ◽  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Transition Probability ◽  
Clustering Algorithms ◽  
Detection Algorithm ◽  
Community Information ◽  
The Mean ◽  
Community Detection Algorithm ◽  
Spectral Clustering Algorithm

The similarity graphs of most spectral clustering algorithms carry lots of wrong community information. In this paper, we propose a probability matrix and a novel improved spectral clustering algorithm based on the probability matrix for community detection. First, the Markov chain is used to calculate the transition probability between nodes, and the probability matrix is constructed by the transition probability. Then, the similarity graph is constructed with the mean probability matrix. Finally, community detection is achieved by optimizing the NCut objective function. The proposed algorithm is compared with SC, WT, FG, FluidC, and SCRW on artificial networks and real networks. Experimental results show that the proposed algorithm can detect communities more accurately and has better clustering performance.

scholarly journals A spectral method for community detection in moderately sparse degree-corrected stochastic block models

2017 ◽  
Vol 49 (3) ◽  
pp. 686-721 ◽  
Author(s):  
Lennart Gulikers ◽  
Marc Lelarge ◽  
Laurent Massoulié
Keyword(s):  
Spectral Method ◽  
Community Detection ◽  
Adjacency Matrix ◽  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Block Models ◽  
Spectral Clustering Algorithm

AbstractWe consider community detection in degree-corrected stochastic block models. We propose a spectral clustering algorithm based on a suitably normalized adjacency matrix. We show that this algorithm consistently recovers the block membership of all but a vanishing fraction of nodes, in the regime where the lowest degree is of order log(n) or higher. Recovery succeeds even for very heterogeneous degree distributions. The algorithm does not rely on parameters as input. In particular, it does not need to know the number of communities.

scholarly journals An Enhanced Spectral Clustering Algorithm with S-Distance

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 596
Author(s):  
Krishna Kumar Sharma ◽  
Ayan Seal ◽  
Enrique Herrera-Viedma ◽  
Ondrej Krejcar
Keyword(s):  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Spatial Clustering ◽  
Clustering Algorithms ◽  
Rank Test ◽  
Customer Churn ◽  
Signed Rank ◽  
Signed Rank Test ◽  
Spectral Clustering Algorithm ◽  
Industrial Databases

Calculating and monitoring customer churn metrics is important for companies to retain customers and earn more profit in business. In this study, a churn prediction framework is developed by modified spectral clustering (SC). However, the similarity measure plays an imperative role in clustering for predicting churn with better accuracy by analyzing industrial data. The linear Euclidean distance in the traditional SC is replaced by the non-linear S-distance (Sd). The Sd is deduced from the concept of S-divergence (SD). Several characteristics of Sd are discussed in this work. Assays are conducted to endorse the proposed clustering algorithm on four synthetics, eight UCI, two industrial databases and one telecommunications database related to customer churn. Three existing clustering algorithms—k-means, density-based spatial clustering of applications with noise and conventional SC—are also implemented on the above-mentioned 15 databases. The empirical outcomes show that the proposed clustering algorithm beats three existing clustering algorithms in terms of its Jaccard index, f-score, recall, precision and accuracy. Finally, we also test the significance of the clustering results by the Wilcoxon’s signed-rank test, Wilcoxon’s rank-sum test, and sign tests. The relative study shows that the outcomes of the proposed algorithm are interesting, especially in the case of clusters of arbitrary shape.

The Spectrum Segmentation Algorithm of Multimode Vibration Signal Based on Spectral Clustering

2011 ◽  
Vol 121-126 ◽  
pp. 2372-2376
Author(s):  
Dan Dan Wang ◽  
Yu Zhou ◽  
Qing Wei Ye ◽  
Xiao Dong Wang
Keyword(s):  
Wave Packet ◽  
Frequency Domain ◽  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Wave Packets ◽  
Vibration Signal ◽  
Segmentation Algorithm ◽  
Frequency Curve ◽  
Macroscopic Observation ◽  
Spectral Clustering Algorithm

The mode peaks in frequency domain of vibration signal are strongly interfered by strong noise, causing the inaccuracy mode parameters. According to this situation, this paper comes up with the thought of mode-peak segmentation based on the spectral clustering algorithm. First, according to the concept of wave packet, the amplitude-frequency of vibration signal is divided into wave packets. Taking each wave packet as a sample of clustering algorithm, the spectral clustering algorithm is used to classify these wave packets. The amplitude-frequency curve of a mode peak becomes a big wave packet in macroscopic. The experiment to simulation signals indicates that this spectral clustering algorithm could accord with the macroscopic observation of mode segmentation effectively, and has outstanding performance especially in strong noise.

Research on Spectral Clustering

2014 ◽  
Vol 687-691 ◽  
pp. 1350-1353
Author(s):  
Li Li Fu ◽  
Yong Li Liu ◽  
Li Jing Hao
Keyword(s):  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Theoretical Foundation ◽  
Clustering Algorithms ◽  
Spectral Graph Theory ◽  
Graph Partition ◽  
Mining Areas ◽  
Spectral Graph ◽  
Definition Of ◽  
Spectral Clustering Algorithm

Spectral clustering algorithm is a kind of clustering algorithm based on spectral graph theory. As spectral clustering has deep theoretical foundation as well as the advantage in dealing with non-convex distribution, it has received much attention in machine learning and data mining areas. The algorithm is easy to implement, and outperforms traditional clustering algorithms such as K-means algorithm. This paper aims to give some intuitions on spectral clustering. We describe different graph partition criteria, the definition of spectral clustering, and clustering steps, etc. Finally, in order to solve the disadvantage of spectral clustering, some improvements are introduced briefly.

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.

Sign in / Sign up

Export Citation Format

Share Document