no code implementations • 22 Dec 2021 • Zite Jiang, Boxiao Liu, Shuai Zhang, Xingzhong Hou, Mengting Yuan, Haihang You
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph $q$ in a data graph $G$.
no code implementations • 29 Sep 2021 • Xingzhong Hou, Boxiao Liu, Fang Wan, Haihang You
The existing pipeline is first pretraining a source model (which contains a generator and a discriminator) on a large-scale dataset and finetuning it on a target domain with limited samples.