logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An efficient loop and clique coarsening algorithm for graph classification

delete2025-10-27
delete0
PRE
AI
X
Xiaorui Qi
Q
Qijie Bai
Y
Yanlong Wen *
H
Haiwei Zhang
X
Xiaojie Yuan
DOI：10.1016/j.patcog.2025.112646delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• A coarsened perspective fits well for graph classification. • Coarsening loop and clique at a linear time complexity. • A shallow coarsen layer addresses well alignment. • A multi-view learning framework to alleviate distribution shift.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available