聚类分析
计算机科学
聚类系数
图形
功率图分析
数据挖掘
人工智能
兰德指数
节点(物理)
深度学习
理论计算机科学
工程类
结构工程
作者
Shiping Wang,Jinbin Yang,Jie Yao,Yang Bai,William Zhu
出处
期刊:IEEE Transactions on Computational Social Systems
[Institute of Electrical and Electronics Engineers]
日期:2023-02-22
卷期号:11 (1): 1302-1314
被引量:13
标识
DOI:10.1109/tcss.2023.3242145
摘要
Graph data have become increasingly important, and graph node clustering has emerged as a fundamental task in data analysis. In recent years, graph node clustering has gradually moved from traditional shallow methods to deep neural networks due to the powerful representation capabilities of deep learning. In this article, we review some representatives of the latest graph node clustering methods, which are classified into three categories depending on their principles. Extensive experiments are conducted on real-world graph datasets to evaluate the performance of these methods. Four mainstream evaluation performance metrics are used, including clustering accuracy, normalized mutual information, adjusted rand index, and F1-score. Based on the experimental results, several potential research challenges and directions in the field of deep graph node clustering are pointed out. This work is expected to facilitate researchers interested in this field to provide some insights and further promote the development of deep graph node clustering.
科研通智能强力驱动
Strongly Powered by AbleSci AI