CSpace
Directed Graph Clustering Algorithms, Topology, and Weak Links
Zhang, Xiao1,2; Lian, Bosen3; Lewis, Frank L.3; Wan, Yan4; Cheng, Daizhan5
2021-06-15
发表期刊IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
ISSN2168-2216
页码15
摘要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.
关键词Directed graphs Clustering algorithms Symmetric matrices Topology Kernel Network topology Linear programming Directed graph clustering nonspectral algorithm Rayleigh's quotient weighted kernel k-means
DOI10.1109/TSMC.2021.3087591
收录类别SCI
语种英语
资助项目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类目Automation & Control Systems ; Computer Science, Cybernetics
WOS记录号WOS:000733235700001
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/59746
专题中国科学院数学与系统科学研究院
通讯作者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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, Xiao]的文章
[Lian, Bosen]的文章
[Lewis, Frank L.]的文章
百度学术
百度学术中相似的文章
[Zhang, Xiao]的文章
[Lian, Bosen]的文章
[Lewis, Frank L.]的文章
必应学术
必应学术中相似的文章
[Zhang, Xiao]的文章
[Lian, Bosen]的文章
[Lewis, Frank L.]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。