Complex network clustering algorithm based on Jordan-form of Laplace-matrix
Among existing clustering algorithms,the graph-Laplacian-based spectrum clustering algorithm has rigorous theoretical basis and high accuracy.However,the application of this algorithm is limited by its dependence on the prior knowledge,such as the number and the size of clusters.Based on the Jordan...
Saved in:
| Main Authors: | Jian-wei NIU, Bin DAI, Chao TONG, Guan-ying HUO, Jing PENG |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.03.002/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Enumeration of Jordan′s Normal Form of k-nilpotent Matrices
by: CHEN Jian-da, et al.
Published: (2019-08-01) -
Wrapping Generalized Laplace and Generalized Discrete Laplace Distributions
by: Barry C. Arnold, et al.
Published: (2025-07-01) -
Classical special functions of matrix arguments
by: Dmytro Shutiak, et al.
Published: (2024-12-01) -
On Generalizations of Jacobi–Jordan Algebras
by: Hani Abdelwahab, et al.
Published: (2024-11-01) -
Coupled of Semi Analytic Approach Associated with Laplace Transform First Step for Solving Matrix Differential Equations Quadratic Form when the Time-Delay in Noise Term
by: Khalid Hammood AL-Jizani
Published: (2024-11-01)