Skip to content
/ HADA Public

HADA (Hiearachical Adversarial Domain Alignment) for brain graph prediction and classification.


Notifications You must be signed in to change notification settings


Repository files navigation


HADA (Hiearachical Adversarial Domain Alignment) for brain graph prediction code, created by Alaa Bessadok. Please contact for inquiries. Thanks.

HADA pipeline


This work is published in MICCAI 2019 and it is selected as oral presentation at the “PRedictive Intelligence in MEdicine” (PRIME) workshop, Shenzhen, China.

Hierarchical Adversarial Domain Alignment (HADA) is a generative adversarial network (GAN) based framework for predicting a brain graph from a source graph using a hierarchical domain alignment. Our HADA framework comprises three key steps (1) hierarchical domain alignment, (2) target graph prediction and, (3) disease classification. We have evaluated our method on ABIDE dataset ( Detailed information can be found in the original paper ( and our research paper video on the BASIRA Lab YouTube channel ( In this repository, we release the code for training and testing HADA on a simulated dataset with paired source and target graphs drawn from two different distributions.


The code has been tested with Python 2.7, Anaconda2-5.3.0 and TensorFlow 1.5 on Ubuntu 16.04. GPU is not needed to run the code. You also need some of the following Python packages, which can be installed via pip:

Tensorflow Numpy scikit-learn Scipy SIMLR

Run from Jupyter Notebook

We provide a demo code for the usage of HADA for target graph prediction from a source graph. In we run HADA on a simulated dataset with 150 subjects and each has 595 features (very similar to the connectomic data we used in our paper).


YouTube videos to install and run the code and understand how HADA works

To install and run HADA, check the following YouTube video:

To learn about how HADA works, check the following YouTube video:


In order to use our framework, you need to provide:
• a sourceGraph and a targetGraph matrices, each of size (n * m). n denotes the total number of subjects in the dataset and m the number of features.
• a label list including the label of each subject in the dataset such as healthy or disordered.

Related references

Adversarially Regularized Graph Autoencoder (ARGA): Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph autoencoder. [] (2018) [].

Single‐cell Interpretation via Multi‐kernel LeaRning (SIMLR): Wang, B., Ramazzotti, D., De Sano, L., Zhu, J., Pierson, E., Batzoglou, S.: SIMLR: a tool for large-scale single-cell analysis by multi-kernel learning. [] (2017) [].

Please cite the following paper when using HADA

title={Hierarchical Adversarial Connectomic Domain Alignment for Target Brain Graph Prediction and Classification from a Source Graph},
author={Bessadok, Alaa and Mahjoub, Mohamed Ali and Rekik, Islem},
booktitle={International Workshop on PRedictive Intelligence In MEdicine},

Paper link on ResearchGate: