Contrastive general graph matching with adaptive augmentation sampling
Graph matching has important applications in pattern recognition and beyond. Current approaches predominantly adopt supervised learning, demanding extensive labeled data which can be limited or costly. Meanwhile, self-supervised learning methods for graph matching often require additional side infor...
Saved in:
Main Authors: | BO, Jianyuan, FANG, Yuan |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9537 https://ink.library.smu.edu.sg/context/sis_research/article/10537/viewcontent/IJCAI24_GCGM.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A learned generalized geodesic distance function-based approach for node feature augmentation on graphs
by: AZAD, Amitoz, et al.
Published: (2024) -
View-based 3D object retrieval by bipartite graph matching
by: Wen, Y., et al.
Published: (2013) -
On the feasibility of Simple Transformer for dynamic graph modeling
by: WU, Yuxia, et al.
Published: (2024) -
View-based 3D Object Retrieval by Bipartite Graph Matching
by: WEN, Yue, et al.
Published: (2012) -
Effective graph kernels for evolving functional brain networks
by: WANG, Xinlei, et al.
Published: (2023)