A Manifold Regularized Multi-Task Learning Model for IQ Prediction from Multiple fMRI Paradigms
Multi-modal brain functional connectivity (FC) data have shown great potential for providing insights into individual variations in behavioral and cognitive traits. The joint learning of multi-modal imaging data can utilize the intrinsic association, and thus can boost the learning performance. Although several multi-task based learning models have already been proposed by viewing the feature learning on each modality as one task, most of them ignore the geometric structure information inherent in the modalities, which may play an important role in extracting discriminative features. In this paper, we propose a new manifold regularized multi-task learning model by simultaneously considering between-subject and between-modality relationships. Besides employing a group-sparsity regularizer to jointly select a few common features across multiple tasks (modalities), we design a novel manifold regularizer to preserve the structure information both within and between modalities in our model. This will make our model more adaptive for realistic data analysis. Our model is then validated on the Philadelphia Neurodevelopmental Cohort dataset, where we regard our modalities as functional MRI (fMRI) data collected under two paradigms. Specifically, we conduct experimental studies on fMRI based FC network data in two task conditions for intelligence quotient (IQ) prediction. The results demonstrate that our proposed model can not only achieve improved prediction performance, but also yield a set of IQ-relevant biomarkers.
Code (0)
등록된 구현이 없습니다.
Tasks
Functional ConnectivityMulti-Task LearningSimilar Papers 제목 키워드 기반
Multiple graph regularized protein domain ranking
Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the …
Learning manifold to regularize nonnegative matrix factorization
Inthischapterwediscusshowtolearnanoptimalmanifoldpresentationto regularize nonegative matrix factorization (NMF) for data representation problems. NMF,whichtriestorepresentanonnegativedatamatrixasaproductoftwolowrank non…
feature selectiongraph constructionGraph LearningModel SelectionManifold Regularized Discriminative Neural Networks
Unregularized deep neural networks (DNNs) can be easily overfit with a limited sample size. We argue that this is mostly due to the disriminative nature of DNNs which directly model the conditional probability (or score)…
Discriminative Sparse Coding on Multi-Manifold for Data Representation and Classification
Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics, etc. However, the conventional sparse coding algorith…
General ClassificationSubspace Tracking with Dynamical Models on the Grassmannian
Tracking signals in dynamic environments presents difficulties in both analysis and implementation. In this work, we expand on a class of subspace tracking algorithms which utilize the Grassmann manifold -- the set of li…