| 注册
首页|期刊导航|计算机工程|基于双重对比学习和硬样本挖掘的多视图图聚类算法

基于双重对比学习和硬样本挖掘的多视图图聚类算法

QIAN Lifeng LI Jing ZOU Xuxi CHEN Yu GU Yalin WEI Xunhu

计算机工程2025,Vol.51Issue(12):82-95,14.
计算机工程2025,Vol.51Issue(12):82-95,14.DOI:10.19678/j.issn.1000-3428.0069632

基于双重对比学习和硬样本挖掘的多视图图聚类算法

Multi-view Graph Clustering Algorithm Based on Dual Contrastive Learning and Hard Sample Mining

QIAN Lifeng 1LI Jing 1ZOU Xuxi 2CHEN Yu 3GU Yalin 2WEI Xunhu2

作者信息

  • 1. College of Computer Science and Technology/College of Artificial Intelligence,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,Jiangsu,China
  • 2. Nanjing NARI Information and Communication Technology Co.,Ltd.,Nanjing 211106,Jiangsu,China
  • 3. State Grid Shanghai Municipal Electric Power Company,Shanghai 200072,China
  • 折叠

摘要

Abstract

As a key research direction in the field of graph mining,graph clustering aims to discover substructures or node groups with similarities from graph data and classify them into the same cluster.The multi-view graph clustering algorithm integrates multiple views of graph data and fully utilizes the underlying information to improve the clustering quality.In recent years,improvements in graph contrastive learning have driven the rapid development of multi-view graph clustering based on deep graph learning.However,improving the recognition of node representations using existing graph contrastive learning methods is challenging.A multi-view graph clustering method based on dual contrastive learning and hard sample mining is proposed to address these issues.First,the node representation is smoothed using graph filters to mitigate the impact of noisy nodes.Subsequently,node compactness comparison learning and node consistency comparison learning are designed to improve the compactness of node representations within the same cluster and the consistency of node representations between different views.Finally,considering the issue of false negatives in multi-view graph clustering based on graph contrastive learning,a hard sample mining strategy guided by clustering is proposed to improve the clustering performance of multi-view graphs.Experiments conducted on three real-world datasets,ACM,DBLP,and IMDB,reveal that the proposed method achieves accuracies of 94.49%,93.22%,and 57.51%,respectively.These values are higher than those of the eight baseline comparison methods.

关键词

图挖掘/多视图/图聚类/深度图学习/图对比学习

Key words

graph mining/multi-view/graph clustering/deep graph learning/graph contrastive learning

分类

信息技术与安全科学

引用本文复制引用

QIAN Lifeng,LI Jing,ZOU Xuxi,CHEN Yu,GU Yalin,WEI Xunhu..基于双重对比学习和硬样本挖掘的多视图图聚类算法[J].计算机工程,2025,51(12):82-95,14.

基金项目

国家电网有限公司总部科技项目(5108-202218280A-2-152-XG). (5108-202218280A-2-152-XG)

计算机工程

OA北大核心

1000-3428

访问量0
|
下载量0
段落导航相关论文