1 code implementation • CVPR 2023 • Runzhong Wang, Ziao Guo, Shaofei Jiang, Xiaokang Yang, Junchi Yan
Graph matching (GM) aims at discovering node matching between graphs, by maximizing the node- and edge-wise affinities between the matched elements.
Ranked #1 on Graph Matching on Willow Object Class (F1 score metric)
no code implementations • 22 Jan 2022 • Zhengrong Xue, Ziao Guo, Yiwei Guo
Popular node embedding methods such as DeepWalk follow the paradigm of performing random walks on the graph, and then requiring each node to be proximate to those appearing along with it.