An Improved Spectral Clustering Community Detection Algorithm Based on Probability Matrix
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 calcul...
Main Authors: | Shuxia Ren, Shubo Zhang, Tao Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2020/4540302 |
Similar Items
-
Complex Network Filtering and Compression Algorithm Based on Triangle-Subgraph
by: Shuxia Ren, et al.
Published: (2020-01-01) -
Community Detection Algorithm Based on Nonnegative Matrix Factorization and Improved Density Peak Clustering
by: Hong Lu, et al.
Published: (2020-01-01) -
A Community Detection Algorithm Based on Topology Potential and Spectral Clustering
by: Zhixiao Wang, et al.
Published: (2014-01-01) -
An Improved Local Community Detection Algorithm Using Selection Probability
by: Shixiong Xia, et al.
Published: (2014-01-01) -
Bad Data Detection Algorithm for PMU Based on Spectral Clustering
by: Zhiwei Yang, et al.
Published: (2020-01-01)