MinCutPool

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

MinCutPool is a trainable pooling operator for graphs that learns to map nodes into clusters. The method is trained to approximate the minimum K-cut of the graph to ensure that the clusters are balanced, while also jointly optimizing the objective of the task at hand.

출처: Spectral Clustering with Graph Neural Networks for Graph Pooling

소개 논문: Spectral Clustering with Graph Neural Networks for Graph Pooling