返回
Contrastive graph clustering with adaptive filter
DOI:10.1016/j.eswa.2023.119645.png)
摘要
En 中文
Graph clustering has received significant attention in recent years due to the breakthrough of graph neural networks (GNNs). However, GNNs frequently assume strong data homophily, which is not true in many real -world applications. Furthermore, practical graphs are typically noisy and sparse, which inevitably degrades the clustering performance. To this end, we propose a novel Contrastive Graph Clustering (CGC) method with adaptive filter framework. We first design an adaptive filter that can automatically learn a suitable filter for different data, mining holistic information beyond low-frequency components and encoding topology structure information into features. Afterward, we learn a refined graph based on a graph-level contrastive mechanism, which further boosts graph discriminability. Extensive experiments show that the proposed CGC method achieves significant improvement over state-of-the-art methods on several benchmark datasets. In particular, our simple method, which does not employ neural networks, outperforms many deep learning approaches.
Keyword:
Node clustering
Graph learning
Contrastive learning
High-pass filter
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Spectrophotometric Determination of Carbon Disulfide Using Bis(4-(4 -Nitrophenyl)azo-2-Nitrophenyl) Disulfide双 (4-硝基苯基) azo-2-Nitrophenyl) 二硫化物分光光度法测定二硫化碳
Deep neighbor-aware embedding for node clustering in attributed graphs属性图中节点聚类的深度邻居感知嵌入
PATTERN RECOGNITION
IF7.6

