1 code implementation • 2 Feb 2025 • Jiaxing Xu, Yongqiang Chen, Xia Dong, Mengcheng Lan, Tiancheng Huang, Qingtian Bian, James Cheng, Yiping Ke
Graph Neural Networks (GNNs) have shown promising in analyzing brain networks, but there are two major challenges in using GNNs: (1) distribution shifts in multi-site brain network data, leading to poor Out-of-Distribution (OOD) generalization, and (2) limited interpretability in identifying key brain regions critical to neurological disorders.
1 code implementation • 25 Jan 2025 • Qingtian Bian, Marcus Vinícius de Carvalho, Tieying Li, Jiaxing Xu, Hui Fang, Yiping Ke
Another challenge lies in aligning the domain-specific and cross-domain sequences.
no code implementations • 28 Sep 2024 • Jiaxing Xu, Mengcheng Lan, Xia Dong, Kai He, Wei zhang, Qingtian Bian, Yiping Ke
Some recent methods have proposed utilizing multiple atlases, but they neglect consistency across atlases and lack ROI-level information exchange.
1 code implementation • 17 Sep 2024 • Jiaxing Xu, Kai He, Mengcheng Lan, Qingtian Bian, Wei Li, Tieying Li, Yiping Ke, Miao Qiao
It generates a prior-knowledge-enhanced contrast graph to address the distribution shifts across sub-populations by a two-stream attention mechanism.
1 code implementation • 9 Sep 2023 • Qingtian Bian, Jiaxing Xu, Hui Fang, Yiping Ke
To dually improve the performance of temporal states evolution and incremental recommendation, we design a Pseudo-Multi-Task Learning (PMTL) paradigm by stacking the incremental single-target recommendations into one multi-target task for joint optimization.
2 code implementations • 7 Jul 2023 • Jiaxing Xu, Qingtian Bian, Xinhang Li, Aihu Zhang, Yiping Ke, Miao Qiao, Wei zhang, Wei Khang Jeremy Sim, Balázs Gulyás
Our contributions underscore the potential of ContrastPool for advancing the understanding of brain networks and neurodegenerative conditions.
1 code implementation • 25 May 2023 • Jiaxing Xu, Aihu Zhang, Qingtian Bian, Vijay Prakash Dwivedi, Yiping Ke
We first investigate different kinds of connectivities existing in a local neighborhood and identify a substructure called union subgraph, which is able to capture the complete picture of the 1-hop neighborhood of an edge.