Linking ADHD and Behavioral Assessment Through Identification of Shared Diagnostic Task-Based Functional Connections

A mixed literature implicates atypical connectivity involving attentional, reward and task inhibition networks in ADHD. The neural mechanisms underlying the utility of behavioral tasks in ADHD diagnosis are likewise underexplored. We hypothesized that a machine-learning classifier may use task-based functional connectivity to compute a joint probability function that identifies connectivity signatures that accurately predict ADHD diagnosis and performance on a clinically-relevant behavioral task, providing an explicit neural mechanism linking behavioral phenotype to diagnosis. We analyzed archival MRI and behavioral data of 80 participants (64 male) who had completed the go/no-go task from the longitudinal follow-up of the Multimodal Treatment Study of ADHD (MTA 168) (mean age = 24 years). Cross-mutual information within a functionally-defined mask measured functional connectivity for each task run. Multilayer feedforward classifier models identified the subset of functional connections that predicted clinical diagnosis (ADHD vs. Control) and split-half performance on the Iowa Gambling Task (IGT). A sample of random models trained on functional connectivity profiles predicted validation set clinical diagnosis and IGT performance with 0.91 accuracy and d' > 2.9, indicating very high sensitivity and specificity. We identified the most diagnostic functional connections between visual and ventral attentional networks and the anterior default mode network. Our results show that task-based functional connectivity is a biomarker of ADHD. Our analytic framework provides a template approach that explicitly ties behavioral assessment measures to both clinical diagnosis, and functional connectivity. This may differentiate otherwise similar diagnoses, and promote more efficacious intervention strategies.

A Recurrent Probabilistic Neural Network with Dimensionality Reduction Based on Time-series Discriminant Component Analysis

This paper proposes a probabilistic neural network (NN) developed on the basis of time-series discriminant component analysis (TSDCA) that can be used to classify high-dimensional time-series patterns. TSDCA involves the compression of high-dimensional time series into a lower dimensional space using a set of orthogonal transformations and the calculation of posterior probabilities based on a continuous-density hidden Markov model with a Gaussian mixture model expressed in the reduced-dimensional space. The analysis can be incorporated into an NN, which is named a time-series discriminant component network (TSDCN), so that parameters of dimensionality reduction and classification can be obtained simultaneously as network coefficients according to a backpropagation through time-based learning algorithm with the Lagrange multiplier method. The TSDCN is considered to enable high-accuracy classification of high-dimensional time-series patterns and to reduce the computation time taken for network training. The validity of the TSDCN is demonstrated for high-dimensional artificial data and electroencephalogram signals in the experiments conducted during the study.