Edge-aware Hard Clustering Graph Pooling for Brain Imaging
- URL: http://arxiv.org/abs/2308.11909v7
- Date: Thu, 29 Feb 2024 17:17:16 GMT
- Title: Edge-aware Hard Clustering Graph Pooling for Brain Imaging
- Authors: Cheng Zhu, Jiayi Zhu, Xi Wu, Lijuan Zhang, Shuqi Yang, Ping Liang,
Honghan Chen, Ying Tan
- Abstract summary: We propose a novel edge-aware hard clustering graph pool (EHCPool), which is tailored to dominant edge features and redefines the clustering process.
EHCPool has the potential to probe different types of dysfunctional brain networks from a data-driven perspective.
- Score: 8.425787611090776
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph Convolutional Networks (GCNs) can capture non-Euclidean spatial
dependence between different brain regions. The graph pooling operator, a
crucial element of GCNs, enhances the representation learning capability and
facilitates the acquisition of abnormal brain maps. However, most existing
research designs graph pooling operators solely from the perspective of nodes
while disregarding the original edge features. This confines graph pooling
application scenarios and diminishes its ability to capture critical
substructures. In this paper, we propose a novel edge-aware hard clustering
graph pool (EHCPool), which is tailored to dominant edge features and redefines
the clustering process. EHCPool initially introduced the 'Edge-to-Node' score
criterion which utilized edge information to evaluate the significance of
nodes. An innovative Iteration n-top strategy was then developed, guided by
edge scores, to adaptively learn sparse hard clustering assignments for graphs.
Additionally, a N-E Aggregation strategy is designed to aggregate node and edge
features in each independent subgraph. Extensive experiments on the multi-site
public datasets demonstrate the superiority and robustness of the proposed
model. More notably, EHCPool has the potential to probe different types of
dysfunctional brain networks from a data-driven perspective. Method code:
https://github.com/swfen/EHCPool
Related papers
- Spectral Greedy Coresets for Graph Neural Networks [61.24300262316091]
The ubiquity of large-scale graphs in node-classification tasks hinders the real-world applications of Graph Neural Networks (GNNs)
This paper studies graph coresets for GNNs and avoids the interdependence issue by selecting ego-graphs based on their spectral embeddings.
Our spectral greedy graph coreset (SGGC) scales to graphs with millions of nodes, obviates the need for model pre-training, and applies to low-homophily graphs.
arXiv Detail & Related papers (2024-05-27T17:52:12Z) - LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering [59.89626219328127]
Graph clustering is a fundamental problem in machine learning.
Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers.
We propose to address this problem from a fresh perspective of graph information theory.
arXiv Detail & Related papers (2024-05-20T05:46:41Z) - ENADPool: The Edge-Node Attention-based Differentiable Pooling for Graph Neural Networks [19.889547537748395]
Graph Neural Networks (GNNs) are powerful tools for graph classification.
One important operation for GNNs is the downsampling or pooling that can learn effective embeddings from the node representations.
We propose a new hierarchical pooling operation, namely the Edge-Node Attention-based Differentiable Pooling (ENADPool)
arXiv Detail & Related papers (2024-05-16T16:08:49Z) - Cluster-based Graph Collaborative Filtering [55.929052969825825]
Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems.
Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution.
We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
arXiv Detail & Related papers (2024-04-16T07:05:16Z) - Redundancy-Free Self-Supervised Relational Learning for Graph Clustering [13.176413653235311]
We propose a novel self-supervised deep graph clustering method named Redundancy-Free Graph Clustering (R$2$FGC)
It extracts the attribute- and structure-level relational information from both global and local views based on an autoencoder and a graph autoencoder.
Our experiments are performed on widely used benchmark datasets to validate the superiority of our R$2$FGC over state-of-the-art baselines.
arXiv Detail & Related papers (2023-09-09T06:18:50Z) - Higher-order Clustering and Pooling for Graph Neural Networks [77.47617360812023]
Graph Neural Networks achieve state-of-the-art performance on a plethora of graph classification tasks.
HoscPool is a clustering-based graph pooling operator that captures higher-order information hierarchically.
We evaluate HoscPool on graph classification tasks and its clustering component on graphs with ground-truth community structure.
arXiv Detail & Related papers (2022-09-02T09:17:10Z) - Edge but not Least: Cross-View Graph Pooling [76.71497833616024]
This paper presents a cross-view graph pooling (Co-Pooling) method to better exploit crucial graph structure information.
Through cross-view interaction, edge-view pooling and node-view pooling seamlessly reinforce each other to learn more informative graph-level representations.
arXiv Detail & Related papers (2021-09-24T08:01:23Z) - CAGNN: Cluster-Aware Graph Neural Networks for Unsupervised Graph
Representation Learning [19.432449825536423]
Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision.
We present a novel cluster-aware graph neural network (CAGNN) model for unsupervised graph representation learning using self-supervised techniques.
arXiv Detail & Related papers (2020-09-03T13:57:18Z) - EdgeNets:Edge Varying Graph Neural Networks [179.99395949679547]
This paper puts forth a general framework that unifies state-of-the-art graph neural networks (GNNs) through the concept of EdgeNet.
An EdgeNet is a GNN architecture that allows different nodes to use different parameters to weigh the information of different neighbors.
This is a general linear and local operation that a node can perform and encompasses under one formulation all existing graph convolutional neural networks (GCNNs) as well as graph attention networks (GATs)
arXiv Detail & Related papers (2020-01-21T15:51:17Z) - Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling [31.812988573924674]
In graph neural networks (GNNs), pooling operators compute local summaries of input graphs to capture their global properties.
We propose the Node Decimation Pooling (NDP), a pooling operator for GNNs that generates coarser graphs while preserving the overall graph topology.
NDP is more efficient compared to state-of-the-art graph pooling operators while reaching, at the same time, competitive performance on a significant variety of graph classification tasks.
arXiv Detail & Related papers (2019-10-24T21:42:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.