Directed Graph Clustering Algorithms, Topology, and Weak Links
文献类型：期刊论文
| 作者 | Zhang, Xiao1,2; Lian, Bosen3; Lewis, Frank L.3; Wan, Yan4; Cheng, Daizhan5 |
| 刊名 | IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
 |
| 出版日期 | 2021-06-15 |
| 页码 | 15 |
| 关键词 | Directed graphs Clustering algorithms Symmetric matrices Topology Kernel Network topology Linear programming Directed graph clustering nonspectral algorithm Rayleigh's quotient weighted kernel k-means |
| ISSN号 | 2168-2216 |
| DOI | 10.1109/TSMC.2021.3087591 |
| 英文摘要 | In this article, a general approach for directed graph clustering and two new density-based clustering objectives are presented. First, using an equivalence between the clustering objective functions and a trace maximization expression, the directed graph clustering objectives are converted into the corresponding weighted kernel k-means problems. Then, a nonspectral algorithm, which covers both the direction and weight information of the directed graphs, is thus proposed. Next, with Rayleigh's quotient, the upper and lower bounds of clustering objectives are obtained. After that, we introduce a new definition of weak links to characterize the effectiveness of clustering. Finally, illustrative examples are given to demonstrate effectiveness of the results. This article provides a glance at the potential connection between density-based and pattern-based clustering. Compared with other approaches for directed graph clustering, the method proposed in this article naturally avoids the loss of the nonsymmetric edge data because there is no need for any additional symmetrization. |
| 资助项目 | National Natural Science Foundation of China[61773371] ; Office of Naval Research[N00014-17-1-2239] ; Office of Naval Research[N00014-18-12221] ; National Science Foundation[ECCS-1839804] ; Army Research Office[W911NF-20-10132] |
| WOS研究方向 | Automation & Control Systems ; Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000733235700001 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/59745]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhang, Xiao |
| 作者单位 | 1.Chinese Acad Sci, Acad Math & Syst Sci, Natl Ctr Math & Interdisciplinary Sci, Beijing 100190, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Syst & Control, Beijing 100190, Peoples R China 3.Univ Texas Arlington, UTA Res Inst, Ft Worth, TX 76118 USA 4.Univ Texas Arlington, Elect Engn Dept, Arlington, TX 76019 USA 5.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, Xiao,Lian, Bosen,Lewis, Frank L.,et al. Directed Graph Clustering Algorithms, Topology, and Weak Links[J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS,2021:15. |
| APA | Zhang, Xiao,Lian, Bosen,Lewis, Frank L.,Wan, Yan,&Cheng, Daizhan.(2021).Directed Graph Clustering Algorithms, Topology, and Weak Links.IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS,15. |
| MLA | Zhang, Xiao,et al."Directed Graph Clustering Algorithms, Topology, and Weak Links".IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2021):15. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。