.png){kind=icon}
返回
Community-Imbalanced Graph Sampling
.png){kind=icon}
PRE
AI
DOI：10.1109/TBDATA.2025.3600032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A community-imbalanced graph refers to a graph containing multiple communities with large differences in node and edge scales. Graph sampling is a widely used graph reduction technique to accelerate graph computations and simplify graph visualizations. However, existing graph sampling algorithms may encounter several problems, including the loss of small communities, disconnections between communities, and distortions of community scale distribution, on maintaining the community structures in a community-imbalanced graph. In this work, a new quality indicator is proposed to determine if a graph can be regarded as a community-imbalanced graph. A community-imbalanced graph sampling (CIGS) algorithm is proposed to address the community-imbalanced graph sampling problems. Three new evaluation metrics are proposed to assess the performance of community structure maintenance of graph sampling. An algorithm performance experiment and a user study are conducted to evaluate the effectiveness of the proposed CIGS.
Keyword:
Graph sampling
community-imbalanced graph
graph visualization
node-link diagram
期刊
I
IF:
5.7
论文数:
887
被引数:
3.0K
机构
引用论文
.png){kind=icon}
分享收藏Sampling Methods for Efficient Training of Graph Convolutional Networks: A Survey图卷积网络高效训练的抽样方法综述
OAAI
OAAI分享收藏分享收藏
查看更多内容