Pooling layer from An End-to-End Deep Learning Architecture for Graph Classification
k (int) – The number of nodes to hold for each graph.
Compute sort pooling.
graph (DGLGraph) – The graph.
feat (mxnet.NDArray) – The input node feature with shape \((N, D)\) where \(N\) is the number of nodes in the graph.
The output feature with shape \((B, k * D)\), where \(B\) refers to the batch size.
- Return type