Fragmentation

2000년 도입 · 논문 123편에서 사용

Given a pattern $P,$ that is more complicated than the patterns, we fragment $P$ into simpler patterns such that their exact count is known. In the subgraph GNN proposed earlier, look into the subgraph of the host graph. We have seen that this technique is scalable on large graphs. Also, we have seen that subgraph GNN is more expressive and efficient than traditional GNN. So, we tried to explore the expressibility when the pattern is fragmented into smaller subpatterns.

출처: Improving Expressivity of Graph Neural Networks using Localization

소개 논문: Improving Expressivity of Graph Neural Networks using Localization