arrow
返回

LookCom: Learning Optimal Network for Community Detection

delete2022-02-01
delete5
PRE
AI
Y
Yixiang Dong
罗敏楠 封面图
罗敏楠 (Minnan Luo) *
李
李俊东 (Jundong Li)
蔡登 封面图
蔡登 (Deng Cai)
Q
Qinghua Zheng
DOI:10.1109/TKDE.2020.2987784delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Community detection is one of the fundamental tasks in graph mining, which aims to identify group assignment of nodes in a complex network. Recently, network embedding techniques have demonstrated their strong power in advancing the community detection task and achieve better performance than various traditional methods. Despite their empirical success, most of the existing algorithms directly leverage the observed coarse network structure for community detection. Therefore, they often lead to suboptimal performance as the observed connections fail to capture the essential tie strength information among nodes precisely and account for the impact of noisy links. In this paper, an optimal network structure for community detection is introduced to characterize the fine-grained tie strength information between connected nodes and alleviate the adverse effects of noisy links. To obtain an expressive node representation for community detection, we learn the optimal network structure and network embeddings in a joint framework, instead of using a two-stage approach to derive the node embeddings from the coarse network topology. In particular, we formulate the joint framework as an optimization problem and an alternating optimization algorithm is exploited to solve the proposed optimization problem. Additionally, theoretical analyses regarding the computational complexity and the convergence of the optimization algorithm are also provided. Extensive experiments on both synthetic and real-world networks demonstrate the effectiveness and superiority of the proposed framework.
Keyword:
Image edge detection
Task analysis
Noise measurement
Optimization
Network topology
Laplace equations
Proteins
Community detection
optimal network
network embedding
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.8K
被引数:
3.2W

机构

X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
U
University of Virginia
学者数:
3.0W
论文数: 2.7W
被引数: 4.1W
Z
zhejiang university
学者数:
17.7W
论文数: 12.1W
被引数: 152
学者 查看更多机构
引用论文

引用论文

Prostate-derived Ets factor, an oncogenic driver in breast cancer
err2017-05-04
err0
errOAAI
errAshwani K Sood; Joseph Geradts; Jessica Young
err分享
err收藏
err分享
err收藏
Using Geodesic Space Density Gradients for Network Community Detection
err2017-04-01
err34
errOAAI
errMahmood, Arif; Small, Michael; Al-Maadeed, Somaya Ali; Rajpoot, Nasir
err分享
err收藏
学者 查看更多内容