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: | , , , , |
|---|---|
| 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!
|
| _version_ | 1841539761891704832 |
|---|---|
| author | Jian-wei NIU Bin DAI Chao TONG Guan-ying HUO Jing PENG |
| author_facet | Jian-wei NIU Bin DAI Chao TONG Guan-ying HUO Jing PENG |
| author_sort | Jian-wei NIU |
| collection | DOAJ |
| description | 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 form of graph Laplacian,an algorithm was proposed which can obtain the prior knowledge,and perform the primary clustering based on the eigenvalues of the Jordan form.The modularity density function of clusters was defined,and an improved spectrum clustering algorithm with the help of the function and the primary clustering was proposed.The experiments were conducted on diverse datasets showing that,compared with the classic algorithms such as Fast-Newman and Girvan-Newman,the algorithm can reach a high clustering accuracy and a fast convergence rate. |
| format | Article |
| id | doaj-art-bc2f14497282426a8a1d24f2c27a74f6 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-bc2f14497282426a8a1d24f2c27a74f62025-01-14T06:42:50ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-03-0135112159679941Complex network clustering algorithm based on Jordan-form of Laplace-matrixJian-wei NIUBin DAIChao TONGGuan-ying HUOJing PENGAmong 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 form of graph Laplacian,an algorithm was proposed which can obtain the prior knowledge,and perform the primary clustering based on the eigenvalues of the Jordan form.The modularity density function of clusters was defined,and an improved spectrum clustering algorithm with the help of the function and the primary clustering was proposed.The experiments were conducted on diverse datasets showing that,compared with the classic algorithms such as Fast-Newman and Girvan-Newman,the algorithm can reach a high clustering accuracy and a fast convergence rate.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.03.002/complex networkclustering algorithmLaplace-matrixJordan-formprior knowledge |
| spellingShingle | Jian-wei NIU Bin DAI Chao TONG Guan-ying HUO Jing PENG Complex network clustering algorithm based on Jordan-form of Laplace-matrix Tongxin xuebao complex network clustering algorithm Laplace-matrix Jordan-form prior knowledge |
| title | Complex network clustering algorithm based on Jordan-form of Laplace-matrix |
| title_full | Complex network clustering algorithm based on Jordan-form of Laplace-matrix |
| title_fullStr | Complex network clustering algorithm based on Jordan-form of Laplace-matrix |
| title_full_unstemmed | Complex network clustering algorithm based on Jordan-form of Laplace-matrix |
| title_short | Complex network clustering algorithm based on Jordan-form of Laplace-matrix |
| title_sort | complex network clustering algorithm based on jordan form of laplace matrix |
| topic | complex network clustering algorithm Laplace-matrix Jordan-form prior knowledge |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.03.002/ |
| work_keys_str_mv | AT jianweiniu complexnetworkclusteringalgorithmbasedonjordanformoflaplacematrix AT bindai complexnetworkclusteringalgorithmbasedonjordanformoflaplacematrix AT chaotong complexnetworkclusteringalgorithmbasedonjordanformoflaplacematrix AT guanyinghuo complexnetworkclusteringalgorithmbasedonjordanformoflaplacematrix AT jingpeng complexnetworkclusteringalgorithmbasedonjordanformoflaplacematrix |