It is challenging for generative models to learn a distribution over graphs because of the lack of permutation invariance: nodes may be ordered arbitrarily across graphs, and standard graph alignment is combinatorial and notoriously expensive. We propose AlignGraph, a group of generative models that combine fast and efficient graph alignment methods with a family of deep generative models that are invariant to node permutations. Our experiments demonstrate that our framework successfully learns graph distributions, outperforming competitors by 25% -560% in relevant performance scores.
翻译:对于基因模型来说,由于缺乏变异性,在图形上学习分布是困难的:节点可以任意排列在图形之间,标准图形对齐是组合式的,而且费用昂贵。 我们提出AleignGraph,这是一组基因模型,将快速高效的图形对齐方法与一系列深厚的变异型模型结合起来,这些模型不会出现节点变异。我们的实验表明,我们的框架成功地学习了图形分布,在相关的性能分数中,优于竞争者的比例为25%至560 % 。