Decoding models, such as those underlying multivariate classification algorithms, have been increasingly used to infer cognitive or clinical brain states from measures of brain activity obtained by functional magnetic resonance imaging (fMRI). The practicality of current classifiers, however, is restricted by two major challenges. First, due to the high data dimensionality and low sample size, algorithms struggle to separate informative from uninformative features, resulting in poor generalization performance. Second, popular discriminative methods such as support vector machines (SVMs) rarely afford mechanistic interpretability. In this paper, we address these issues by proposing a novel generative-embedding approach that incorporates neurobiologically interpretable generative models into discriminative classifiers. Our approach extends previous work on trial-by-trial classification for electrophysiological recordings to subject-by-subject classification for fMRI and offers two key advantages over conventional methods: it may provide more accurate predictions by exploiting discriminative information encoded in ‘hidden’ physiological quantities such as synaptic connection strengths; and it affords mechanistic interpretability of clinical classifications. Here, we introduce generative embedding for fMRI using a combination of dynamic causal models (DCMs) and SVMs. We propose a general procedure of DCM-based generative embedding for subject-wise classification, provide a concrete implementation, and suggest good-practice guidelines for unbiased application of generative embedding in the context of fMRI. We illustrate the utility of our approach by a clinical example in which we classify moderately aphasic patients and healthy controls using a DCM of thalamo-temporal regions during speech processing. Generative embedding achieves a near-perfect balanced classification accuracy of 98% and significantly outperforms conventional activation-based and correlation-based methods. This example demonstrates how disease states can be detected with very high accuracy and, at the same time, be interpreted mechanistically in terms of abnormalities in connectivity. We envisage that future applications of generative embedding may provide crucial advances in dissecting spectrum disorders into physiologically more well-defined subgroups.
Neurological and psychiatric spectrum disorders are typically defined in terms of particular symptom sets, despite increasing evidence that the same symptom may be caused by very different pathologies. Pathophysiological classification and effective treatment of such disorders will increasingly require a mechanistic understanding of inter-individual differences and clinical tools for making accurate diagnostic inference in individual patients. Previous classification studies have shown that functional magnetic resonance imaging (fMRI) can be used to differentiate between healthy controls and neurological or psychiatric patients. However, these studies are typically based on descriptive patterns and indirect measures of neural activity, and they rarely afford mechanistic insights into the underlying condition. In this paper, we address this challenge by proposing a classification approach that rests on a model of brain function and exploits the rich discriminative information encoded in directed interregional connection strengths. Based on an fMRI dataset acquired from moderately aphasic patients and healthy controls, we illustrate that our approach enables more accurate classification and deeper mechanistic insights about disease processes than conventional classification methods.
Citation: Brodersen KH, Schofield TM, Leff AP, Ong CS, Lomakina EI, Buhmann JM, et al. (2011) Generative Embedding for Model-Based Classification of fMRI Data. PLoS Comput Biol 7(6): e1002079. https://doi.org/10.1371/journal.pcbi.1002079
Editor: Olaf Sporns, Indiana University, United States of America
Received: January 7, 2011; Accepted: April 20, 2011; Published: June 23, 2011
Copyright: © 2011 Brodersen et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This study was funded by the University Research Priority Program ‘Foundations of Human Social Behaviour’ at the University of Zurich (KHB, KES), the SystemsX.ch project NEUROCHOICE (KHB, KES; http://www.systemsx.ch/), the NCCR ‘Neural Plasticity’ (KES; http://www.nccr-neuro.uzh.ch/), the Wellcome Trust (APL; grant ME033459MES), and the NIHR CBRC at University College Hospitals London (APL). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Recent years have seen a substantial increase in the use of functional neuroimaging data for investigating healthy brain function and detecting abnormalities. The most popular type of analysis is statistical parametric mapping (SPM), a mass-univariate encoding model of fMRI data in which the statistical relationship between experimental (or clinical) variables and haemodynamic measurements of neural activity is examined independently for every voxel in the brain . While this approach has led to many insights about functional abnormalities in psychiatric and neurological disorders, it suffers from two limitations. First, since univariate models are insensitive to spatially distributed patterns of neural activity, they may fail to detect subtle, distributed differences between patients and healthy controls that are not expressed as local peaks or clusters of activity . Second, while encoding models such as SPM are excellent for describing regional differences in brain activity across clinical groups, they are less well suited for clinical decision making, where the challenge is to predict the disease state of an individual subject from measured brain activity –.
An alternative approach is provided by multivariate decoding methods, in particular classification algorithms. Unlike mass-univariate encoding models, these methods predict an experimental variable (e.g., a trial-specific condition or subject-specific disease state) from the activity pattern across voxels (see – for reviews). Using multivariate decoding models instead of mass-univariate encoding models has interesting potential for clinical practice, particularly for diseases that are difficult to diagnose. Consequently, much work is currently being invested in constructing classifiers that can predict the diagnosis of individual subjects from structural or functional brain data , , , , , –. Historically, these efforts date back to positron emission tomography (PET) studies in the early 1990s . Today, attempts of using multivariate classifiers for subject-by-subject diagnosis largely focus on MRI and fMRI data , , , .
Challenges for current classification approaches
Despite their increasing popularity, two challenges critically limit the practical applicability of current classification methods for functional neuroimaging data. First, classifying subjects directly in voxel space is often a prohibitively difficult task. This is because functional neuroimaging datasets (i) typically exhibit a low signal-to-noise ratio, (ii) are obtained in an extremely high-dimensional measurement space (a conventional fMRI scan contains more than 100,000 voxels), and (iii) are characterized by a striking mismatch between the large number of voxels and the small number of available subjects. As a result, even the most carefully designed algorithms have great difficulties in reliably finding jointly informative voxels while ignoring uninformative sources of noise. Popular strategies include: preselecting voxels based on an anatomical mask , or a separate functional localizer , ; spatial subsampling ; finding informative voxels using univariate models , ,  or locally multivariate searchlight methods , ; and unsupervised dimensionality reduction , . Other recently proposed strategies attempt to account for the inherent spatial structure of the feature space , ,  or use voxel-wise models to infer a particular stimulus identity –. Finally, those submissions that performed best in the Pittsburgh Brain Activity Interpretation Competition (PBAIC 2007) highlighted the utility of kernel ridge regression  and relevance vector regression , . The common assumption underlying all of these approaches is that interesting variations of the data with regard to the class variable are confined to a manifold that populates a latent space of much lower dimensionality than the measurement space.
The second challenge for classification methods concerns the interpretation of their results. Most classification studies to date draw conclusions from overall prediction accuracies , , the spatial deployment of informative voxels , , , –, the temporal evolution of discriminative information , , , , , or patterns of undirected regional correlations . These approaches may support discriminative decisions, but they are blind to the neuronal mechanisms (such as effective connectivity or synaptic plasticity) that underlie discriminability of brain or disease states. In other words: while some conventional classification studies have achieved impressive diagnostic accuracy , their results have not improved our mechanistic understanding of disease processes.
Generative embedding for model-based classification may provide a solution to the challenges outlined above. It is based on the idea that both the performance and interpretability of conventional approaches could be improved by taking into account available prior knowledge about the process generating the observed data (see  for an overview). (The term generative embedding is sometimes used to denote a particular model-induced feature space, or so-called generative score space, in which case the associated line of research is said to be concerned with generative embeddings. Here, we will use the term in singular form to denote the process of using a generative model to project the data into a generative score space, rather than using the term to denote the space itself.) Generative embedding rests on two components: a generative model for principled selection of mechanistically interpretable features and a discriminative method for classification (see Figure 1).
This schematic illustrates the key principles by which generative embedding enables model-based classification for functional magnetic resonance imaging (fMRI). Initially, each subject is represented by a measure of blood oxygen level dependent (BOLD) activity with one temporal and three spatial dimensions. In the first analysis step (model inversion), these subject-specific data are used to estimate the parameters of a generative model, which represents a mapping of the data onto a probability distribution in a parametric family (see Sections ‘DCM for fMRI’ and ‘Model inversion’). In the second step (kernel construction), a kernel function is defined that represents a similarity metric between any two fitted models and . This step can be split up into an initial mapping followed by a conventional kernel . The kernel implies a generative score space (or model-based feature space; see Section ‘Kernel construction’), which provides a comprehensive statistical representation of every subject. In this illustrative participant, the influence of region A on region B as well as the self-connection of region B were particularly strong. In the third step, a classifier is used to find a separating hyperplane between groups of subjects, based exclusively on their model-based representations (see Section ‘Classification’). When using a linear kernel, each feature corresponds to the coupling strength between two regions, which, in the fourth step, enables a mechanistic interpretation of feature weights in the context of the underlying model (see Section ‘Interpretation of the feature space’). Here, the influence of A on B and C were jointly most informative in distinguishing between groups. For a concrete implementation of this procedure, see Figure 2.
Generative models have proven powerful in explaining how observed data are caused by the underlying (neuronal) system. Unlike their discriminative counterparts, generative models capture the joint probability of the observed data and the class labels, governed by a set of parameters of a postulated generative process. One example in neuroimaging is dynamic causal modelling (DCM) . DCM enables statistical inference on physiological quantities that are not directly observable with current methods, such as directed interregional coupling strengths and their modulation, e.g., by synaptic gating . (We use the term DCM to refer both to a specific dynamic causal model and to dynamic causal modelling as a method.) From a pathophysiological perspective, disturbances of synaptic plasticity and neuromodulation are at the heart of psychiatric spectrum diseases such as schizophrenia  or depression . It is therefore likely that classification of disease states could benefit from exploiting estimates of these quantities. While DCM is a natural (and presently the only) candidate for obtaining model-based estimates of synaptic plasticity (cf. , ), the most widely used approach to classification relies on discriminative methods, such as support vector machines (SVMs) , . Together, DCM and SVM methods thus represent natural building blocks for classification of disease states.
Generative embedding represents a special case of using generative kernels for classification, such as the P-kernel  or the Fisher kernel . Generative kernels have been fruitfully exploited in a range of applications – and define an active area of research –. In the special case of generative embedding, a generative kernel is used to construct a generative score space. This is a model-based feature space in which the original observations have been replaced by statistical representations that potentially yield better class separability when fed into a discriminative classifier. Thus, an unsupervised embedding step is followed by a supervised classification step. In previous work, we suggested a concrete implementation of this approach for the trial-by-trial classification of electrophysiological recordings . In this paper, we propose a DCM-based generative-embedding approach for subject-by-subject classification of fMRI data, demonstrate its performance using a clinical data set, and highlight potential methodological pitfalls (and how to avoid them).
DCM  views the brain as a nonlinear dynamical system of interconnected neuronal populations whose directed connection strengths are modulated by external perturbations (i.e., experimental conditions) or endogenous activity. Here, we will use DCM to replace high-dimensional fMRI time series by a low-dimensional vector of parameter estimates. The discriminative part of our approach will be based on an SVM with a linear kernel. This algorithm learns to discriminate between two groups of subjects by estimating a separating hyperplane in their feature space. Since this paper brings together techniques from different statistical domains that tend to be used by different communities, we have tried to adopt a tutorial-like style and introduce basic concepts of either approach in the Methods section.
Generative embedding for fMRI may offer three substantial advantages over conventional classification methods. First, because the approach aims to fuse the strengths of generative models with those of discriminative methods, it may outperform conventional voxel-based schemes, especially in those cases where crucial discriminative information is encoded in ‘hidden’ quantities such as directed (synaptic) connection strengths. Second, the construction of the feature space is governed and constrained by a biologically motivated systems model. As a result, feature weights can be interpreted mechanistically in the context of this model. Incidentally, the curse of dimensionality faced by many conventional feature-extraction methods may turn into a blessing when using generative embedding: the higher the temporal and spatial resolution of the fMRI data, the more precise the estimation of the parameters of the generative model, leading to better discriminability. Third, our approach can be used to compare alternative generative model architectures in situations where evidence-based approaches, such as Bayesian model selection, are not applicable. We will deal with these three points in more detail in the Discussion.
Structure of this paper
The remainder of this paper is structured as follows. First, we summarize the general ideas of generative embedding and the specific generative and discriminative components used here, i.e., DCM and SVM. We then inspect different procedures of how generative embedding could be implemented practically while distinguishing between approaches with and without bias. Third, we illustrate the utility of our approach, using empirical data obtained during speech processing in healthy volunteers and patients with moderate aphasia. These data have been explored in a previous study, in which DCM and Bayesian model selection (BMS) were applied to investigate the effective connectivity among cortical areas activated by intelligible speech . In a subsequent study, we extended this analysis to patients with aphasia (Schofield et al., in preparation). In the present paper, we ask whether subject-specific directed connection strengths among cortical regions involved in speech processing contain sufficiently rich discriminative information to enable accurate predictions of the diagnostic category (healthy or aphasic) of a previously unseen individual. In brief, we found that (i) generative embedding yielded a near-perfect classification accuracy, (ii) significantly outperformed conventional ‘gold standard’ activation-based and correlation-based classification schemes, and (iii) afforded a novel mechanistic interpretation of the differences between aphasic patients and healthy controls during processing of speech and speech-like sounds.
The study was approved by the local research ethics committee at UCL, and all participants gave informed consent.
Combining generative models and discriminative methods
Most methods for classification attempt to find a linear function that separates examples as accurately as possible in a space of features (e.g., voxel-wise measurements). Such discriminative classification methods differ from generative methods in two ways. First, rather than trying to estimate the joint density of observations and class labels, which is not needed for classification, or trying to estimate class-conditional probability densities, which can be difficult, discriminative classifiers directly model the class an example belongs to. Second, many discriminative methods do not operate on examples themselves but are based on the similarity between any two examples, expressed as the inner product between their feature vectors. This provides an elegant way of transforming a linear classifier into a more powerful nonlinear one. (Note that the term discriminative methods is used here to collectively describe the class of learning algorithms that find a discriminant function for mapping an example onto a class label , typically without invoking probability theory. This is in contrast to discriminative models, which model the conditional probability , and generative models, which first model the full joint probability and then derive .)
The most popular classification algorithm of the above kind is the -norm soft-margin support vector machine (SVM) , , , . The only way in which examples enter an SVM is in terms of an inner product . This product can be replaced by the evaluation of a kernel function , which implicitly computes the inner product between the examples in a new feature space, .
The -norm SVM is a natural choice when the goal is maximal prediction accuracy. However, it usually leads to a dense solution (as opposed to a sparse solution) in which almost all features are used for classification. This is suboptimal when one wishes to understand which model parameters contribute most to distinguishing groups, which will be the focus in the Section ‘Interpretation of the feature space.’ In this case, an SVM that enforces feature sparsity may be more useful. One simple way of inducing sparsity is to penalize the number of non-zero coefficients by using an -regularizer. Unlike other regularizers, the -norm (also known as the counting norm) reduces the feature-selection bias inherent in unbounded regularizers such as the - or -norm. The computational cost of optimizing an -SVM objective function is prohibitive, because the number of subsets of items which are of size is exponential in . We therefore replace the -norm by a capped -regularizer which has very similar properties . One way of solving the resulting optimization problem is to use a bilinear programming approach . Here, we use a more efficient difference-of-convex-functions algorithm (Ong & Thi, under review).
In summary, we will use two types of SVM. For the purpose of classification (Section ‘Classification’), we aim to maximize the potential for highly accurate predictions by using an -norm SVM. For the purpose of feature selection and interpretation (Section ‘Interpretation of the feature space’), we will focus on feature sparsity by using an approximation to an -norm SVM, which will highlight those DCM parameters jointly deemed most informative in distinguishing between groups.
Most current applications of classification algorithms in neuroimaging begin by embedding the measured recordings of each subject in a -dimensional Euclidean space . In fMRI, for example, a subject can be represented by a vector of features, each of which corresponds to the signal measured in a particular voxel at a particular point in time. This approach makes it possible to use any learning algorithm that expects vectorial input, such as an SVM; but it ignores the spatio-temporal structure of the data as well as the process that generated them. This limitation has motivated the search for kernel methods that provide a more natural way of measuring the similarity between the functional datasets of two subjects, for example by incorporating prior knowledge about how the data were generated, which has led to the idea of generative kernels, as described below.
Generative kernels are functions that define a similarity metric for observed examples using a generative model. In the case of a dynamic causal model (DCM), for example, the observed time series are modelled by a system of parameterized differential equations with Gaussian observation noise. Generative embedding defines a generative kernel by transferring the models into a vectorial feature space in which an appropriate similarity metric is defined (see Figure 1). This feature space, which we will refer to as a generative score space, embodies a model-guided dimensionality reduction of the observed data. The kernel defined in this space could be a simple inner product of feature vectors, or it could be based on any other higher-order function, as long as it is positive definite . In conclusion, model-based classification via generative embedding is a hybrid generative-discriminative approach: it merges the explanatory abilities of generative models with the classification power of discriminative methods.
The specific implementation for fMRI data proposed in this paper consists of four conceptual steps which are summarized in Figure 1 and described in the following subsections. First, a mapping is designed that projects an example from data space onto a multivariate probability distribution in a parametric family . In our case, we use the fMRI data from each subject to estimate the posterior density of the parameters of a DCM (Sections ‘DCM for fMRI’ and ‘Model inversion’). Second, a probability kernel is constructed that represents a similarity measure between two inverted DCMs. Here, we use a simple linear kernel on the maximum a posteriori (MAP) estimates of the model parameters (Sections ‘Strategies for unbiased model specification and inversion’ and ‘Kernel construction’). Third, this kernel is used for training and testing a discriminative classifier (Section ‘Classification’). Here, we employ a linear SVM to distinguish between patients and healthy controls. Fourth, the constructed feature space can be investigated to find out which model parameters jointly contributed most to distinguishing the two groups (Section ‘Interpretation of the feature space’). We will conclude with an example in which we distinguish between patients with moderate aphasia and healthy controls (Sections ‘Experimental design, data acquisition, and preprocessing,’ ‘Implementation of generative embedding,’ and ‘Comparative analyses’).
DCM for fMRI
DCM regards the brain as a nonlinear dynamic system of interconnected nodes, and an experiment as a designed perturbation of the system's dynamics . Its goal is to provide a mechanistic model for explaining experimental measures of brain activity. While the mathematical formulation of DCMs varies across measurement types, common mechanisms modelled by all DCMs include synaptic connection strengths and experimentally induced modulation thereof , –. Generally, DCMs strive for neurobiological interpretability of their parameters; this is one core feature distinguishing them from alternative approaches, such as multivariate autoregressive models  which characterize inter-regional connectivity in a phenomenological fashion.
DCMs consist of two hierarchical layers . The first layer is a neuronal model of the dynamics of interacting neuronal populations in the context of experimental perturbations. Critically, its parameters are neurobiologically interpretable, representing, for example, synaptic weights and their context-specific modulation; electrophysiological DCMs describe even more fine-grained processes such as spike-frequency adaptation or conduction delays. Experimental manipulations enter the model in two different ways: they can elicit responses through direct influences on specific regions (e.g., sensory inputs), or they can modulate the strength of coupling among regions (e.g., task demands or learning). The second layer of a DCM is a biophysically motivated forward model that describes how a given neuronal state translates into a measurement. Depending on the measurement modality, this can be a set of nonlinear differential equations (as for fMRI ) or a simple linear equation (as for EEG ). While the forward model plays a critical role in model inversion, it is the parameters of the neuronal model that are typically of primary scientific interest.
In this paper, we will use the classical bilinear DCM for fMRI  as implemented in the software package SPM8/DCM10,(1)(2)where represents the neuronal state vector at time , is a matrix of endogenous connection strengths, represents the additive change of these connection strengths induced by modulatory input , and denotes the strengths of direct (driving) inputs. These neuronal parameters are rate constants with units .
The haemodynamic forward model is given by the function , a nonlinear operator that links a neuronal state to a predicted blood oxygen level dependent (BOLD) signal via changes in vasodilation, blood flow, blood volume, and deoxyhaemoglobin content (see  for details). This forward model has haemodynamic parameters and Gaussian measurement error . The haemodynamic parameters primarily serve to account for variations in neurovascular coupling across regions and subjects and are typically not of primary scientific interest. In addition, the haemodynamic parameters exhibit strong inter-dependencies and thus high posterior covariances and low precision , which makes it difficult to establish the distinct contribution afforded by each parameter. For these reasons, the model-induced feature spaces in this paper will be based exclusively on the neuronal parameters .
In summary, DCM provides a mechanistic model for explaining measured time series of brain activity as the outcome of hidden dynamics in an interconnected network of neuronal populations and its experimentally induced perturbations. Inverting such a model (see next section) means to infer the posterior distribution of the parameters of both the neuronal and the forward model from observed responses of a specific subject. Its mechanistic interpretability and applicability to single-subject data makes DCM an attractive candidate for generative embedding of fMRI data.
Bayesian inversion of a given dynamic causal model defines a map that projects a given example (i.e., data from a single subject) onto a multivariate probability distribution in a parametric family . The model architecture specifies the neuronal populations (regions) of interest, experimentally controlled inputs , synaptic connections, and a prior distribution over the parameters . Given the model and subject-specific data , model inversion proceeds in an unsupervised and subject-by-subject fashion, i.e., in ignorance of the subject label that will later be used in the context of classification. (The literature on DCM has adopted the convention of denoting the hidden states by and the data by . Here, in order to keep the notation consistent with the literature on classification, we use for the data and for the labels. A distinct symbol for the hidden states is not required here.) DCM uses a fully Bayesian approach to parameter estimation, with empirical priors for the haemodynamic parameters and conservative shrinkage priors for the coupling parameters , . Combining the prior density over the parameters with the likelihood function yields the posterior density . This inversion can be carried out efficiently by maximizing a variational free-energy bound to the log model evidence, , under Gaussian assumptions about the posterior (the Laplace assumption; see  for details). Given parameters, model inversion thus yields a subject-specific probability density that can be fully described in terms of a vector of posterior means and a covariance matrix .
Model specification and selection is an important theme in DCM . In this paper we are not concerned with the question of which of several alternative DCMs may be optimal for explaining the data or for classifying subjects; these issues can be addressed using Bayesian evidence methods ,  or by applying cross-validation to the classifications suggested by each of the models, respectively (see  for an example). However, an important issue is that model specification cannot be treated in isolation from its subsequent use for classification. Specifically, some procedures for selecting time series can lead to biased estimation of classification accuracy. In the next section, we therefore provide a detailed assessment of different strategies for time series selection in DCM-based generative embedding and highlight those procedures which safeguard against obtaining optimistic estimates of classification performance.
Strategies for unbiased model specification and inversion
For conventional fMRI classification procedures, good-practice guidelines have been suggested for avoiding an optimistic bias in assessing classification performance , . Generally, to obtain an unbiased estimate of generalization accuracy, a classifier must be applied to test data that have not been used during training. In generative embedding, this principle implies that the specification of the generative model cannot be treated in isolation from its use for classification. In this section, we structure different strategies in terms of a decision tree and evaluate the degree of bias they invoke (see Figure 2).
This figure illustrates how generative embedding can be implemented using dynamic causal modelling. Depending on whether regions of interest are defined anatomically, based on across-subjects functional contrasts, or based on between-group contrasts, there are several possible practical procedures. Some of these procedures may lead to biased estimates of classification accuracy (grey boxes). Procedures a, c, and f avoid this bias, and are therefore recommended (green boxes). The analysis of the illustrative dataset described in this paper follows procedure c.
The first distinction is based on whether the regions of interest (ROIs) underlying the DCM are defined anatomically or functionally. When ROIs are defined exclusively on the basis of anatomical masks (Figure 2a), the selection of voxels is independent of the functional data. Using time series from these regions, the model is inverted separately for each subject. Thus, given subjects, a single initial model-specification step is followed by subject-wise model inversions. The resulting parameter estimates can be safely submitted to a cross-validation procedure to obtain an unbiased estimate of classification performance.
Whenever functional contrasts have played a role in defining ROIs, subsequent classification may no longer be unbiased. This is because a functional contrast introduces statistics of the data into voxel selection, which usually generates a bias. In this case, we ask whether contrasts are defined in an across-subjects or a between-groups fashion. In the case of an across-subjects contrast (which does not take into account group membership), one might be tempted to follow the same logic as in the case of anatomical ROI definitions: a single across-subjects contrast, computed for all subjects, guides the selection of voxels, and the resulting DCM is inverted separately for each subject (Figure 2b). Unfortunately, this procedure is problematic. When using the resulting parameter estimates in a leave-one-out cross-validation scheme, in every repetition the features would be based on a model with regions determined by a group contrast that was based on the data from all subjects, including the left-out test subject. This means that training the classifier would no longer be independent of the test data, which violates the independence assumption underlying cross-validation, a situation referred to as peeking . In consequence, the resulting generalization estimate may exhibit an optimistic bias. To avoid this bias, model specification must be integrated into cross-validation (Figure 2c). Specifically, in each fold, we leave out one subject as a test subject and compute an across-subjects group contrast from the remaining subjects. The resulting choice of voxels is then used for specifying time series in each subject and the resulting model is inverted separately for each subject, including the left-out test subject. This procedure is repeated times, each time leaving out a different subject. In total, the model will be inverted times. In this way, within each cross-validation fold, the selection of voxels is exclusively based on the training data, and no peeking is involved. This is the strategy adopted for the dataset analysed in this paper, as detailed in the Section ‘Implementation of generative embedding’.
When functional contrasts are not defined across all subjects but between groups, the effect of peeking may become particularly severe. Using a between-groups contrast to define regions of interest on the basis of all available data, and using these regions to invert the model for each subject (Figure 2d) would introduce information about group membership into the process of voxel selection. Thus, feature selection for both training and test data would be influenced by both the data and the label of the left-out test subject. One way of decreasing the resulting bias is to integrate model specification into cross-validation (Figure 2e). In this procedure, the between-groups contrast is computed separately for each training set (i.e., based on subjects), and the resulting regions are used to invert the model for the test subject. This means that the class label of the test subject is no longer involved in selecting features for the test subject. However, the test label continues to influence the features of the training set, since these are based on contrasts defined for a group that included the test subject. This bias can only be removed by adopting the same laborious procedure as with across-subjects contrasts: by using a between-groups contrast involving subjects, inverting the resulting model separately for each subject, and repeating this procedure times (Figure 2f). This procedure guarantees that neither the training procedure nor the features selected for the test subject were influenced by the data or the label of the test subject.
In summary, the above analysis shows that there are three practical strategies for the implementation of generative embedding that yield an unbiased cross-validated accuracy estimate. If regions are defined anatomically, the model is inverted separately for each subject, and the resulting parameter estimates can be safely used in cross-validation (Figure 2a). Otherwise, if regions are defined by a functional contrast, both the definition of ROIs and model inversion for all subjects need to be carried out separately for each cross-validation fold (Figure 2c,f).
Given a set of inverted subject-specific generative models, the kernel defines the similarity metric under which these models are assessed within a discriminative classifier. In generative embedding, the choice of an appropriate kernel depends on the definition of the generative score space. A straightforward way to create a Euclidean vector space from an inverted DCM is to consider the posterior means or maximum a posteriori (MAP) estimates of model parameters of interest (e.g., parameters encoding synaptic connection strengths). More formally, we can define a mapping that extracts a subset of MAP estimates from the posterior distribution . This simple -dimensional vector space expresses discriminative information encoded in the connection strengths between regions, as opposed to activity levels within these regions. Alternatively, one could also incorporate elements of the posterior covariance matrix into the vector space. This would be beneficial if class differences were revealed by the precision with which connection strengths can be estimated from the data.
Once a generative score space has been created, any conventional kernel can be used to compare two inverted models. The simplest one is the linear kernel , representing the inner product between two vectors and . Nonlinear kernels, such as quadratic, polynomial or radial basis function kernels, transform the generative score space, which makes it possible to consider quadratic (or higher-order) class boundaries and therefore account for possible interactions between features. Nonlinear kernels, however, have several disadvantages for generative embedding. As the complexity of the kernel increases, so does the risk of overfitting. Furthermore, feature weights are easiest to interpret in relation to the underlying model when they do not undergo further transformation; then, the contribution of a particular feature (i.e., model parameter) to the success of the classifier can be understood as the degree to which the neuronal mechanism represented by that parameter aids classification. A simple linear kernel will therefore be our preferred choice.
In summary, in this paper, we define a mapping from a subject-specific posterior distribution of model parameters to a feature vector . We then use a linear kernel for this model-based feature space. Together, these two steps define a probability kernel that represents a similarity metric between two inverted models and allows for mechanistic interpretations of how group membership of different subjects is encoded by spatiotemporal fMRI data.
While a kernel describes how two subjects can be compared using a generative model of their fMRI data, it does not specify how such a comparison could be used for making predictions. This gap is filled by discriminative classification methods. As described in the Section ‘Combining generative models and discriminative methods’, a natural choice is the -norm soft-margin support vector machine (SVM), which currently represents the most widely used kernel method for classification .
An estimate of classification performance with minimal variance can be obtained by leave-one-out cross-validation. In each fold, the classifier is trained on subjects and tested on the left-out one. Using the training set only, the SVM can be fine-tuned by carrying out a simple line search over the regularization hyperparameter (Eqn. 1), a procedure known as nested cross-validation , .
There are many ways of assessing the generalization performance of a classifier. Here, we are primarily interested in the balanced accuracy, that is, the mean accuracy obtained on either class,(3)where , , , and represent the number of true positives, false positives, true negatives, and false negatives, respectively . The balanced accuracy represents the arithmetic mean between sensitivity and specificity. If the classifier performs equally well on either class, it reduces to the ordinary accuracy (i.e., the ratio of correct predictions to all predictions). If, however, the classifier has taken advantage of an imbalanced dataset, then the ordinary accuracy will be inflated, whereas the balanced accuracy will drop to chance (50%), as desired. The balanced accuracy thus removes the bias from estimates of generalizability that may arise in the presence of imbalanced datasets. A probability interval can be computed by considering the convolution of two Beta-distributed random variables that correspond to the true accuracies on positive and negative examples, respectively. A p-value can then be obtained by computing the posterior probability of the accuracy being below chance .
Interpretation of the feature space
Most classification algorithms can not only be used for making predictions and obtaining an estimate of their generalization error; they can also be used to quantify how much each feature has contributed to classification performance. Such feature weights can sometimes be of greater interest than the classification accuracy itself. In the case of a generative score space, as defined above, each feature is associated with a neurobiologically interpretable model parameter. Provided there are no complex transformations of feature weights (see above), they can be interpreted in the context of the underlying model.
As described in the Section ‘Combining generative models and discriminative methods’, the -norm soft-margin SVM is a natural choice when the goal is maximal prediction accuracy. However, its solution usually implies that almost all features are used for classification. This is suboptimal when one wishes to understand which model parameters, and thus mechanisms, contribute most to distinguishing groups. Therefore, for the purposes of interpreting the model-induced feature space, we use an -regularizer. This approach allows us to characterize the feature space by counting how often a particular feature has been selected in leave-one-out cross-validation.
Experimental design, data acquisition, and preprocessing
In order to illustrate the utility of generative embedding for fMRI, we used data from two groups of participants (patients with moderate aphasia vs. healthy controls) engaged in a simple speech-processing task. The conventional SPM and DCM analyses of these data are published elsewhere; we refer to  and Schofield et al. (in preparation) for detailed descriptions of all experimental procedures.
The two groups of subjects consisted of 26 right-handed healthy participants with normal hearing, English as their first language, and no history of neurological disease (12 female; mean age 54.1 years; range 26–72 years); and 11 patients diagnosed with moderate aphasia due to stroke (1 female; mean age 66.1; range 45–90 years). The patients' aphasia profile was characterized using the Comprehensive Aphasia Test . As a group, they had scores in the aphasic range for: spoken and written word comprehension (single word and sentence level), single word repetition and object naming. It is important to emphasize that the lesions did not affect any of the temporal regions which we included in our model described below (see Schofield et al., in preparation, for detailed information on lesion localization).
Subjects were presented with two types of auditory stimulus: (i) normal speech; and (ii) time-reversed speech, which is unintelligible but retains both speaker identity and the spectral complexity of normal speech. Subjects were given an incidental task, to make a gender judgment on each auditory stimulus, which they indicated with a button press.
Functional T2*-weighted echo-planar images (EPI) with BOLD contrast were acquired using a Siemens Sonata 1.5 T scanner (in-plane resolution 3 mm×3 mm; slice thickness 2 mm; inter-slice gap 1 mm; TR 3.15 s). In total, 122 volumes were recorded in each of 4 consecutive sessions. In addition, a T1-weighted anatomical image was acquired. Following realignment and unwarping of the functional images, the mean functional image of each subject was coregistered to its high-resolution structural image. This image was spatially normalized to standard Montreal Neurological Institute (MNI152) space, and the resulting deformation field was applied to the functional data. These data were then spatially smoothed using an isotropic Gaussian kernel (FWHM 8 mm). In previous work, these data have been analysed using a conventional general linear model (GLM) and DCM; the results are described in Schofield et al. (in preparation). Here, we re-examined the dataset using the procedure shown in Figure 2c, as described in detail in the next subsection.
Implementation of generative embedding
The first level of our statistical analysis employed a mass-univariate analysis in each subject. Each auditory stimulus was modelled as a separate delta function, and the resulting trains of auditory events were convolved with a canonical haemodynamic response function. The first regressor in the design matrix contained all auditory events (i.e., normal and time-reversed speech stimuli); the second regressor modelled intelligibility (normal vs. time-reversed speech) as a parametric modulation. Beta coefficients were estimated for all brain voxels using the general linear model . To identify regions responding to auditory stimulation per se, we used an ‘all auditory events’ contrast based on the first regressor (i.e., a contrast between auditory stimuli and background scanner noise), designed to find early auditory regions required for the perception of any broad-band stimulus, whether it is speech or speech-like.
Second-level (group) analysis.
The second level analysis served to select regions whose voxels entered the subject-specific DCMs (in terms of the first eigenvariate of their time series). In the previous study of these data (Schofield et al., in preparation), we had compared a set of 512 alternative DCMs that embodied competing hypotheses about the architecture of the thalamo-temporal network processing speech-like stimuli per se. Here, we focus on the model which was found to have the highest evidence in our previous study, i.e., the model providing the best trade-off between accuracy and complexity in explaining the data , , . Note that this selection procedure is ignorant of subject labels, which prevents test labels from influencing the training procedure. (An alternative, computationally more expensive approach would be to select the model that affords the best classification accuracy, and integrate this selection step into an overall cross-validation scheme. See  for an example.) In addition, the selection of time series remains independent of the test data. The DCM we used contains 6 regions (medial geniculate body, MGB; Heschl's gyrus, HG; planum temporale, PT), three in each hemisphere, and 14 interregional connections (see Figure 3). Note that this model concerned processing of acoustic stimuli with speech-like spectral properties per se, not differentiating between normal and time-reversed speech; therefore, it did not contain modulatory inputs (corresponding to an empty matrix, see Eqn. 4). Critically, instead of identifying regions functionally by a group contrast, we pre-defined large anatomical masks (16 mm×16 mm×16 mm) that specified only the rough location of the 6 regions of interest (see Table 1 and Supplementary Material). These masks served to guide the selection of time series, using a leave-one-out approach to feature selection as described below.
The diagram illustrates the specific dynamic causal model (DCM) that was used for the illustrative application of generative embedding in this study. It consists of 6 regions (circles), 15 interregional connections (straight arrows between regions), 6 self-connections (circular arrows), and 2 stimulus inputs (straight arrows at the bottom). The specific set of connections shown here is the result of Bayesian model selection that was carried out on the basis of a large set of competing connectivity layouts (for details, see Schofield et al., in preparation). A sparse set of 9 out of 23 connectivity and input parameters (see Figure 10) was found to be sufficiently informative to distinguish between aphasic patients and healthy controls with near-perfect accuracy (see Figure 5). The connections corresponding to these 9 parameters are highlighted in red. Only three parameters were selected in all cross-validation folds and are thus particularly meaningful for classification (bold red arrows); these refer to connections mediating information transfer from the right to the left hemisphere, converging on left PT, which is a key structure in speech processing.
To specify the exact location and extent of our 6 regions of interest, and thus the exact time series that would be modelled by DCM, we used a leave-one-out approach to feature selection. For this purpose, we carried out separate second-level analyses, each time leaving out one subject, and then used a conventional summary-statistic approach  across the remaining subjects to find voxels that survived a one-sample ‘all auditory events’ t-test with a statistical threshold of (uncorrected), across all subjects, within the anatomical masks described above. Note that this contrast is agnostic about diagnostic status (corresponding to Figure 2c). (With the cross-validation scheme used here, a between-group contrast could have been used as well without risking bias; see Section ‘Strategies for unbiased model specification and inversion’. This case would correspond to Figure 2f.) Within each leave-one-out repetition, our procedure yielded 6 voxel sets, one for each region of interest. We used the first eigenvariate over voxels as a representative time series for each region in DCM.
Inversion of the DCM was carried out independently for each subject, and separately for each cross-validation fold (i.e., each group contrast). With regions (and thus modelled time series) differing each time depending on the current set of subjects, this procedure resulted in a total of fitted DCMs. We emphasize once more that model inversion was carried out in an unsupervised fashion, i.e., without reference to the subjects' diagnostic status.
A generative score space was constructed on the basis of the MAP estimates of the neuronal model parameters ( in Eqn. 5). The rzzesulting space contained 22 features: 20 interregional connection strengths ( matrix), no modulatory parameters (as the matrix was empty in the DCM we used), and 2 input parameters ( matrix). All feature vectors were normalized to unit length. To minimize the risk of overfitting and enable a clear interpretation of feature weights, we used a linear kernel. Consequently, the similarity between two subjects was defined as the inner product between the normalized vectors of the posterior means of their model parameters.
An -norm soft-margin linear support vector machine (SVM) was trained and tested using leave-one-out cross-validation. Specifically, in each fold , the classifier was trained on all subjects except , on the basis of the DCM parameter estimates obtained from fitting the voxel time series selected by the group analysis based on all subjects except . The classifier was then tested by applying it to DCM parameter estimates for the time series from subject (using the same voxels as the rest of the group). Crucially, in this way, test data and test labels were neither used for model specification nor for classifier training, preventing optimistic estimates of classification performance. The principles of this unbiased procedure are summarized in Figure 4.
This figure summarizes the three core steps involved in the practical implementation of generative embedding proposed in this paper. This procedure integrates the inversion of a generative model into cross-validation. In step 1, within a given repetition , the model is specified using all subjects except . This yields a set of time series for each subject . In step 2, the model is inverted independently for each subject, giving rise to a set of subject-specific posterior parameter means . In step 3, these parameter estimates are used to train a classifier on all subjects except and test it on subject , which yields a prediction about the class label of subject . After having repeated these three steps for all , the set of predicted labels can be compared with the true labels, which allows us to estimate the algorithm's generalization performance. In addition, parameters that proved jointly discriminative can be interpreted in the context of the underlying generative model. The sequence of steps shown here corresponds to the procedure shown in Figure 2c and 2f, where it is contrasted with alternative procedures that are simpler but risk an optimistic bias in estimating generalization performance.
Within each fold, the complexity penalty of the SVM was selected by a line search in log2 space, to minimize an estimate of the generalization error on the training set (nested cross-validation). To discourage the classifier from acquiring a bias in favour of the majority class, the training set was balanced using a stochastic oversampling strategy. We assessed the generalization performance of the classifier by comparing its predictions to the true subject labels (‘patient’ or ‘healthy control’), resulting in a 2×2 confusion matrix that forms the basis of various common performance measures, such as the accuracy or the area under the receiver-operator characteristic (ROC) curve.
We compared the performance of generative embedding to a range of alternative approaches. To begin with, we examined several conventional activation-based classification schemes. The first method was based on a feature space composed of all voxels within the predefined anatomical masks used for guiding the specification of the DCMs. As above, we used a linear SVM, and all training sets were balanced by oversampling. We will refer to this approach as anatomical feature selection.
The second method, in contrast to the first one, was not only based on the same classifier as in generative embedding but also used exactly the same voxels. Specifically, voxels were selected on the basis of the same ‘all auditory events’ contrast as above, which is a common approach to defining a voxel-based feature space in subject-by-subject classification , , . In every cross-validation fold, only those voxels entered the classifier that survived a t-test (, uncorrected) in the current set of subjects. Training sets were balanced by oversampling. We will refer to this method as contrast feature selection.
The third activation-based method employed a locally multivariate ‘searchlight’ strategy for feature selection. Specifically, in each cross-validation fold, a searchlight sphere (radius 4 mm) was passed across all voxels contained in the anatomical masks described above . Using the training set only, a nested leave-one-out cross-validation scheme was used to estimate the generalization performance of each sphere using a linear SVM with a fixed regularization hyperparameter (). Next, all spheres with an accuracy greater than 75% were used to form the feature space for the current outer cross-validation fold, which corresponds to selecting all voxels whose local neighbourhoods allowed for a significant discrimination between patients and healthy controls at . Both outer and inner training sets were balanced by oversampling. We will refer to this method as searchlight feature selection. To illustrate the location of the most informative voxels, we carried out an additional searchlight analysis, based on the entire dataset as opposed to a subset of size , and used the results to generate a discriminative map (see Figure S1 in the Supplementary Material).
The fourth conventional method was based on a principal component analysis (PCA) to reduce the dimensionality of the feature space constructed from all voxels in the anatomical masks described above. Unlike generative embedding, PCA-based dimensionality reduction finds a linear manifold in the data without a mechanistic view of how those data might have been generated. We sorted all principal components in decreasing order of explained variance. By retaining the 22 top components, the resulting dimensionality matched the dimensionality of the feature space used in generative embedding.
In addition to the above activation-based methods, we compared generative embedding to several approaches based on undirected regional correlations. We began by averaging the activity within each region of interest to obtain region-specific representative time series. We then computed pairwise correlation coefficients to obtain a 15-dimensional feature space of functional connectivity. Next, instead of computing spatial averages, we summarized the activity within each region in terms of the first eigenvariate. Thus, in this approach, the exact same data was used to estimate functional connectivity as was used by DCM to infer effective connectivity. Finally, as suggested in , we created yet another feature space by transforming the correlation coefficients on eigenvariates into z-scores using the Fisher transformation .
In addition to conventional activation- and correlation-based approaches, we also investigated the dependence of generative embedding on the structure of the underlying model. Specifically, we repeated our original analysis on the basis of three alternative models. For the first model, we constructed a feedforward system by depriving the original model of all feedback and interhemispheric connections (Figure 5a); while this model could still, in principle, explain neuronal dynamics throughout the system of interest, it was neurobiologically less plausible. For the second and third model, we kept all connections from the original model but modelled either only the left hemisphere (Figure 5b) or only the right hemisphere (Figure 5c).
To illustrate the specificity of generative embedding, the analysis described in the main text was repeated on the basis of three biologically less plausible models. In contrast to the full model shown in Figure 3, these alternative models either (a) contained no feedback or interhemispheric connections, (b) accounted for activity in the left hemisphere only, or (c) focussed exclusively on the right hemisphere. For results, see Table 2 and Figure 6.
In summary, we compared the primary approach proposed in this paper to 4 conventional activation-based methods, 3 conventional correlation-based methods, and 3 generative-embedding analyses using reduced and biologically less plausible models.
The classification performance of generative embedding was evaluated using the procedure described in Figure 2c. This procedure was compared to several conventional activation-based and correlation-based approaches. As an additional control, generative embedding was carried out on the basis of three biologically ill-informed models. In all cases, a leave-one-subject-out cross-validation scheme was used to obtain the posterior distribution of the balanced accuracy  as well as smooth estimates of the underlying receiver-operating characteristic (ROC) and precision-recall (PC) curves . Results are presented in Table 2 and Figure 6.
Classification based on generative embedding using the model shown in Figure 3 was compared to ten alternative methods: anatomical feature selection, contrast feature selection, searchlight feature selection, PCA-based dimensionality reduction, regional correlations based on region means, regional correlations based on eigenvariates, regional z-transformed correlations based on eigenvariates, as well as generative embedding using three biologically unlikely alternative models (see inset legends for abbreviations). (a) The balanced accuracy and its central 95% posterior probability interval show that all methods performed significantly better than chance (50%) with the exception of classification with anatomical feature selection and generative embedding using a nonsensical model. Differences between activation-based methods (light grey) and correlation-based methods (dark grey) were largely statistically indistinguishable. By contrast, using the full model shown in Figure 3, generative embedding (blue) significantly outperformed all other methods, except when used with biologically unlikely models (Figure 5). (b) Receiver-operating characteristic (ROC) curves of the eleven methods illustrate the trade-off between true positive rate (sensitivity) and false positive rate (1 – specificity) across the entire range of detection thresholds. A larger area under the curve is better. (c) Precision-recall (PR) curves illustrate the trade-off between positive prediction value (precision) and true positive rate (recall). A larger area under the curve is better. Smooth ROC and PR curves were obtained using a binormal assumption on the underlying decision values . For a numerical summary of all results, see Table 2.
The strongest classification performance was obtained when using generative embedding with the full model shown in Figure 3. The approach correctly associated 36 out of 37 subjects with their true disease state, corresponding to a balanced accuracy of 98%. Regarding conventional activation-based methods, classification based on anatomical feature selection did not perform significantly above chance (balanced accuracy 62%, p≈0.089). Contrast feature selection (75%, p≈0.003), searchlight feature selection (73%, p≈0.006), and PCA-based dimensionality reduction (80%, p<0.001) did perform significantly above chance; however, all methods were outperformed significantly by generative embedding (p≈0.003, p≈0.001, and p≈0.045, paired-sample Wald test). Regarding conventional correlation-based methods, all three approaches performed above chance, whether based on correlations amongst the means (70%, p≈0.011), correlations amongst eigenvariates (83%, p<0.001), or z-transformed correlations amongst eigenvariates (74%, p≈0.002). Critically, however, all were significantly outperformed by generative embedding (p<0.001, p≈0.045, p≈0.006). Regarding generative embedding itself, when replacing the original model shown in Figure 3 by a biologically less plausible feedforward model (Figure 5a) or by a model that captured the left hemisphere only (Figure 5b), we observed a significant decrease in performance, from 98% down to 77% (p≈0.002) and 81% (p≈0.008), respectively, although both accuracies remained significantly above chance (p≈0.001 and p<0.001). By contrast, when modelling the right hemisphere only (Figure 5c), performance dropped to a level indistinguishable from chance (59.3%, p≈0.134).
In order to provide a better intuition as to how the generative model shown in Figure 3 created a score space in which examples were much better separated than in the original voxel-based feature space, we produced two scatter plots of the data (see Figure 7). The first plot is based on the peak voxels of the three most discriminative clusters among all regions of interest, evaluated by a searchlight classification analysis. The second plot, by analogy, is based on the three most discriminative model parameters, as measured by two-sample t-tests in the (normalized) generative score space. This illustration shows how the voxel-based projection (left) leads to classes that still overlap considerably, whereas the model-based projection (right) provides an almost perfectly linear separation of patients and controls.
This figure provides an intuition of how a generative model transforms the data from a voxel-based feature space into a generative score space (or model-based feature space), in which classes become more separable. The left plot shows how aphasic patients (red) and healthy controls (grey) are represented in voxel space, based on t-scores from a simple ‘all auditory events’ contrast (see main text). The three axes represent the peaks of those three clusters that showed the strongest discriminability between patients and controls, based on a locally multivariate searchlight classification analysis. They are located in L.PT, L.HG, and R.PT, respectively (cf. Table 1). The right plot shows the three individually most discriminative parameters (two-sample t-test) in the (normalized) generative score space induced by a dynamic causal model of speech processing (see Figure 3). The plot illustrates how aphasic patients and healthy controls become almost perfectly linearly separable in the new space. Note that this figure is based on normalized examples (as used by the classifier), which means the marginal densities are not the same as those shown in Figure 9 but are exactly those seen by the classifier. A stereogram of the generative score space can be found in the Supplementary Material (Figure S4).
Characterization of the feature space
The low dimensionality of the model-based feature space makes it possible to visualize each example in a radial coordinate system, where each axis corresponds to a particular model parameter (see Figure 8). When using parameters that represent directed connection strengths, this form of visualization is reminiscent of the notion of ‘connectional fingerprints’ for characterizing individual cortical regions . In our case, there is no immediately obvious visual difference in fingerprints between aphasic patients and healthy controls. On the contrary, the plot gives an impression of the large variability across subjects and suggests that differences might be subtle and possibly jointly encoded in multiple parameters.
Given the low dimensionality of the model-induced feature space, subjects can be visualized in terms of ‘connectional fingerprints’  that are based on a simple radial coordinate system in which each axis corresponds to the maximum a posteriori (MAP) estimate of a particular model parameter. The plot shows that the difference between aphasic patients (red) and healthy controls (grey) is not immediately obvious, suggesting that it might be subtle and potentially of a distributed nature.
One way of characterizing the discriminative information encoded in individual model parameters more directly is to estimate class-conditional univariate feature densities (see Figure 9). Here, densities were estimated in a nonparametric way using a Gaussian kernel with an automatically selected bandwidth, making no assumptions about the distributions other than smoothness . While most densities are heavily overlapping, a two-sample t-test revealed significant group differences in four model parameters (denoted by stars in Figure 9): the self-connection of L.HG (parameter 4); the influence that L.HG exerts over L.PT (parameter 5); the influence R.MGB on R.PT (parameter 13); and the influence of R.HG on L.HG (parameter 14). All of these were significant at the 0.001 level while no other parameter survived p = 0.05. An extended plot of all bivariate feature distributions, illustrating how well any two features jointly discriminated between patients and healthy controls, can be found in the Supplementary Material (Figure S2).
Separately for patients (red) and healthy controls (grey), the figure shows nonparametric estimates of the class-conditional densities of the maximum a posteriori (MAP) estimates of model parameters. The estimates themselves are shown as a rug along the x-axis. The results of individual (uncorrected) two-sample t-tests, thresholded at p = 0.05, are indicated in the title of each diagram. Three stars (***) correspond to p<0.001, indicating that the associated model parameter assumes very different values for patients and controls.
In order to better understand which DCM parameters jointly enabled the distinction between patients and controls, we examined the frequency with which features were selected in leave-one-out cross-validation when using an SVM with a sparsity-inducing regularizer ,  (see Figure 10). We found that the classifier favoured a highly consistent and sparse set of 9 (out of 22) model parameters; the corresponding synaptic connections are highlighted in red in Figure 3. Notably, this 9-dimensional feature space, when used with the original -norm SVM, yielded the same balanced classification accuracy (98%) as the full 22-dimensional feature space, despite discarding more than two thirds of its dimensions.
A support vector machine with a sparsity-inducing regularizer (capped -regularizer) was trained and tested in a leave-one-out cross-validation scheme, resulting in subsets of selected features. The figure summarizes these subsets by visualizing how often each feature (printed along the y-axis) was selected across the repetitions (given as a fraction on the x-axis). Error bars represent central 95% posterior probability intervals of a Beta distribution with a flat prior over the interval [0, 1]. A group of 9 features was consistently found jointly informative for discriminating between aphasic patients and healthy controls (see main text). An additional figure showing which features were selected in each cross-validation fold can be found in the Supplementary Material (Figure S3). Crucially, since each feature corresponds to a model parameter that describes one particular interregional connection strength, the group of informative features can be directly related back to the underlying dynamic causal model (see highlighted connections in Figure 3).
The above representation disclosed interesting potential mechanisms. For example, discriminative parameters were restricted to cortico-cortical and thalamo-cortical connection strengths, whereas parameters representing auditory inputs to thalamic nuclei did not contribute to the distinction between patients and healthy controls. This finding implies that, as one would expect, low-level processing of auditory stimuli, from brain stem to thalamus, is unimpaired in aphasia and that processing deficiencies are restricted to thalamo-cortical and cortico-cortical networks. In particular, the discriminative connections included the top-down connections from planum temporale to Heschl's gyrus bilaterally; the importance of these connections had also been highlighted by the previous univariate analyses of group-wise DCM parameters in the study by Schofield et al. (in preparation). Furthermore, all of the connections from the right to the left hemisphere were informative for group membership, but none of the connections in the reverse direction. This pattern is interesting given the known specialization of the left hemisphere in language and speech processing and previous findings that language-relevant information is transferred from the right hemisphere to the left, but not vice versa . It implies that aphasia leads to specific changes in connectivity, even in non-lesioned parts of the language network, with a particular effect on inter-hemispheric transfer of speech information. This specificity is seen even more clearly when considering only those three parameters which were selected 100% of the time (i.e., in all cross-validation folds) and are thus particularly meaningful for classification (bold red arrows in Figure 3). The associated connections mediate information transfer from the right to the left hemisphere and converge on the left planum temporale which is a critical structure for processing of language and speech , .
In summary, all selected features represented connectivity parameters (as opposed to stimulus input), their selection was both sparse and highly consistent across resampling repetitions, and their combination was sufficient to afford the same classification accuracy as the full feature set.
Perspectives for generative embedding of fMRI data
Generative embedding for subject-by-subject classification provides three potential advantages over conventional voxel-based methods. The first advantage is that it combines the explanatory strengths of generative models with the classification power of discriminative methods. Thus, in contrast to purely discriminative or purely generative methods, generative embedding is a hybrid approach. It fuses a feature space that captures both the data and their generative process with a classifier that finds the maximum-margin boundary for class separation. Intuitively, this exploits the idea that differences in the generative process between two examples (observations) might provide optimal discriminative information required to enable accurate predictions. In the case of DCM for fMRI, this rationale should pay off whenever the directed connection strengths between brain regions contain more information about a disease state than regional activations or undirected correlations. Indeed, this is what we found in our analyses (cf. Figure 6). Using a DCM-informed data representation might prove particularly relevant in psychiatric disorders, such as schizophrenia or depression, where aberrant effective connectivity and synaptic plasticity are central to the disease process , .
The second advantage of generative embedding for fMRI is that it enables an intuitive and mechanistic interpretation of features and their weights, an important property not afforded by most conventional classification methods , . By using parameter estimates from a mechanistically interpretable model for constructing a feature space, the subsequent classification no longer yields ‘black box’ results but allows one to assess the relative importance of different mechanisms for distinguishing groups (e.g., whether or not synaptic plasticity alters the strengths of certain connections in a particular context). Put differently, generative embedding embodies a shift in perspective: rather than representing sequential data in terms of high-dimensional and potentially highly complex trajectories, we are viewing the data in terms of the coefficients of a well-behaved model of system dynamics. Again, this may be of particular importance for clinical applications, as discussed in more detail below. It is also interesting to note that models like DCM, when used in the context of generative embedding, turn the curse of dimensionality faced by conventional classification methods into a blessing: the higher the spatial and temporal resolution of the underlying fMRI data, the more precise the resulting DCM parameter estimates; this in turn should lead to more accurate predictions.
The third advantage provided by generative embedding is related to model comparison. For any given dataset, there is an infinite number of possible dynamic causal models, differing in the number and location of nodes, in connectivity structure, and in their parameterization (e.g., priors). Competing models can be compared using Bayesian model selection (BMS) , , , , where the best model is the one with the highest model evidence, that is, the highest probability of the data given the model . BMS is a generic approach to distinguish between different models that is grounded in Bayesian probability theory and, when group-specific mechanisms can be mapped onto distinct models, represents a powerful technique for model-based classification in itself. However, there are two scenarios in which BMS is problematic and where classification based on generative embedding may represent a useful alternative . First, BMS requires the data to be identical for all competing models. Thus, in the case of current implementations of DCM for fMRI, BMS enables dynamic model selection (concerning the parameterization and mathematical form of the model equations) but not structural model selection (concerning which regions or nodes should be included in the model). Second, BMS is limited when different groups cannot be mapped onto different model structures, for example when the differences in neuronal mechanisms operate at a finer conceptual scale than can be represented within the chosen modelling framework. In this case, discriminability of subjects may be afforded by differences in (combinations of) parameter estimates under the same model structure (see  for a recent example).
In both these scenarios, the approach proposed in this paper may provide a solution, in that the unsupervised creation of a generative score space can be viewed as a method for biologically informed feature extraction, and the performance of the classifier reflects how much class information is encoded in the model parameters. This view enables a form of model comparison in which the best model is the one that enables the highest classification accuracy. This procedure can be applied even when (i) the underlying data (e.g., the chosen regional fMRI time series) are different, or when (ii) the difference between two models lies exclusively in the pattern of parameter estimates. In this paper, we have illustrated both ideas: structural model selection to decide between a full model and two reduced models that disregard one hemisphere; and dynamic model selection to distinguish between different groups of subjects under the same model structure.
In summary, BMS evaluates the goodness of a model with regard to its generalizability for explaining the data, whereas generative embedding evaluates a model in relation to an external criterion, i.e., how well it allows for inference on group membership of any given subject. This difference is important as it highlights that the concept of a ‘good’ model can be based on fundamentally different aspects, and one could imagine scenarios where BMS and generative embedding arrive at opposing results. If, for example, discriminability of groups relies on a small subspace of the data, then one model (which provides a good accuracy-complexity trade-off for most of the data except that subspace) may have higher evidence, but another model that describes this subspace particularly well but is generally worse for the rest of the data may result in better classification performance (cf. our discussion in ). We will examine the relation and complementary nature of BMS and generative-embedding approaches in future work.
As discussed in this paper, there are three valid strategies for the implementation of generative embedding in fMRI that allow for an unbiased estimate of classification accuracy (Figure 2). If regions (and thus time series) are defined anatomically, the model is inverted separately for each subject, and the resulting parameter estimates can be safely used in cross-validation. If regions are defined by a functional contrast, both time series selection and model inversion for all subjects need to be carried out separately for each cross-validation fold. These procedures clearly have higher computational demands than conventional classification techniques, but the subject-wise nature of model inversion means that generative embedding for fMRI can exploit methods for distributed computing and can thus be implemented even for larger numbers of subjects.
Summary of our findings
In order to demonstrate the utility of generative embedding for fMRI, we acquired and analysed a dataset consisting of 11 aphasic patients and 26 healthy controls. During the experiment, participants were listening to a series of speech and speech-like stimuli. In an initial analysis (Schofield et al., in preparation), we designed a dynamic causal model to explain observed activations in 6 auditory regions of interest. Here, we extended this analysis by examining whether patients and healthy controls could be distinguished on the basis of differences in subject-specific generative models. Specifically, we trained and tested a linear support vector machine on subject-wise estimates of connection strengths. This approach delivered two sets of results.
First, we found strong evidence in favour of the hypothesis that aphasic patients and healthy controls may be distinguished on the basis of differences in the parameters of a generative model alone. Generative embedding did not only yield a near-perfect balanced classification accuracy (98%). It also significantly outperformed conventional activation-based methods, whether they were based on anatomical (62%), contrast (75%), searchlight feature selection (73%), or on a PCA-based dimensionality reduction (80%). Similarly, our approach outperformed conventional correlation-based methods, whether they were based on regional means (70%) or regional eigenvariates (83% and 74%). Furthermore, it is interesting to observe that group separability was reduced considerably when using a less plausible feedforward model (77%). Finally, performance decreased significantly when modelling only the left hemisphere (81%), and it dropped to chance when considering the right hemisphere by itself (60%), which is precisely what one would expect under the view that the left hemisphere is predominantly, but not exclusively, implicated in language processing. Taken together, our findings provide strong support for the central idea of this paper: that critical differences between groups of subjects may be expressed in a highly nonlinear manifold which remains inaccessible by methods relying on activations or undirected correlations, but which can be unlocked by the nonlinear transformation embodied by an appropriate generative model.
Second, since features correspond to model parameters, our approach allowed us to characterize a subset of features (Figure 10) that can be interpreted in the context of the underlying model (Figure 3). This subset showed four remarkable properties. (i) Discriminative parameters were restricted to cortico-cortical and thalamo-cortical connection strengths. On the contrary, parameters representing auditory inputs to thalamic nuclei did not contribute to the distinction between patients and healthy controls. (ii) We observed a high degree of stability across resampling folds. That is, the same 9 (out of 22) features were selected on almost every repetition. (iii) The set of discriminative parameters was found to be sparse, not just within repetitions (which is enforced by the underlying regularizer) but also across repetitions (which is not enforced by the regularizer; see Figure S3 in the Supplementary Material). At the same time, the set was considerably larger than what would be expected from univariate feature-wise t-tests (Figure 9). (iv) The sparse set of discriminative parameters proved sufficient to yield the same balanced classification accuracy (98%) as the full set. These results are consistent with the notion that a distinct mechanism, and thus few parameters, are sufficient to explain differences in processing of speech and speech-like sounds between aphasic patients and healthy controls. In particular, all of the connections from the right to the left hemisphere were informative with regard to group membership, but none of the connections in the reverse direction. This asymmetry resonates with previous findings that language-relevant information is transferred from the right hemisphere to the left, but not vice versa , and suggests that in aphasia connectivity changes in non-lesioned parts of the language network have particularly pronounced effects on inter-hemispheric transfer of speech information from the (non-dominant) right hemisphere to the (dominant) left hemisphere.
It is worthwhile briefly commenting on how the present findings relate to those of the original DCM study by Schofield et al. (in preparation). Two crucial differences are that the previous study (i) applied Bayesian model averaging to a set of 512 models and (ii) statistically examined each of the resulting average connection strengths in a univariate fashion. They found group differences for most connections, highlighting in particular the top-down connections from planum temporale to primary auditory cortex bilaterally. In our multivariate analysis, these two connections were also amongst the most informative ones for distinguishing patients from controls (Figure 3). Schofield et al. also found group differences for interhemispheric connection strengths between left and right Heschl's gyrus, but their univariate approach did not demonstrate any asymmetries. In contrast, our multivariate approach yielded a sparser set of discriminative connections, highlighting the asymmetries of interhemispheric connections described above (Figure 3).
Inference on mechanisms for clinical applications
The example described in this paper was chosen to illustrate the implementation and use of generative embedding for fMRI. It is important to emphasize that this example does not represent the sort of clinical application that we envisage in the long term. Clearly, there are few diagnostic problems when dealing with aphasia and usually a clinical examination by the physician is sufficient. However, this example is useful for demonstrating the utility of generative embedding since the diagnostic status of each subject is known without doubt and the networks involved in speech processing are well characterized. In the future, we hope that our approach will be useful for addressing clinical problems of high practical relevance, for instance for dissecting psychiatric spectrum disorders, such as schizophrenia, into physiologically defined subgroups , or for predicting the response of individual patients to specific drugs. While an increasing number of studies have tried to describe neurobiological markers for psychiatric disorders , , , , , , , , we argue that these studies should be complemented by model-based approaches for inferring biologically plausible mechanisms. Such approaches will be useful in two domains of application: they can be used to decide between competing hypotheses (as in traditional applications of DCM and BMS); and they can harvest the potentially rich discriminative information encoded in aspects of synaptic plasticity or neuromodulation to build classifiers that distinguish between different subtypes of a psychiatric disorder on a physiological basis (using techniques such as generative embedding).
In the case of the illustrative dataset analysed in this paper, generative embedding yielded stronger classification performance than conventional methods, whether they were based on activations or regional correlations. One might think that this superior ability to accurately classify individual subjects determines the clinical value of the approach. Instead, we wish to argue that its clinical value will ultimately depend on whether patients that share the same symptoms can be differentially treated according to the underlying pathophysiology of the disorder. Generative embedding, using biologically plausible and mechanistically interpretable models, may prove critical in establishing diagnostic classification schemes that distinguish between pathophysiologically distinct subtypes of spectrum diseases and allow for predicting individualized behavioural and pharmacological therapy.
Further characterization of the voxel-based feature space. (1) Regions of interest. In order to illustrate generative embedding for fMRI, a dynamic causal model was constructed on the basis of 6 anatomical regions of interest. As described in the paper, the exact location of these regions was determined on the basis of an group contrast and hence varied between cross-validation folds. Regions were defined by 16 mm×16 mm×16 mm cubes centred on the group maxima (see Table 1 in the paper). The figure shows the location and extent of the anatomical masks (green) that were used to define fold-specific DCM regions. (2) Searchlight map. A conventional searchlight analysis  was carried out to illustrate the degree to which a given voxel and its local spherical environment (radius 4 mm) allowed for a separation between aphasic patients and healthy controls. The map is thresholded at p = 0.05 uncorrected and provides a qualitative account of which regions were most informative.
Further characterization of the generative score space. By analogy with the univariate feature densities shown in Figure 9, the discriminative information encoded in simple combinations of model parameters can be illustrated using bivariate scatter plots. The figure indicates how well any two features jointly discriminated between patients and healthy controls. Note that the matrix is symmetric.
Feature selection using a sparse SVM. A support vector machine with a sparsity-inducing regularizer  was used to investigate, based on leave-one-out cross validation, which features were typically selected across the underlying folds. (a) The left figure shows in detail which features were selected in each repetition. For example, when based on all subjects but the first, the classifier selected exactly those 9 features that were selected most of the time; when based on all subjects but the last, a slightly different group of 10 features was favoured. The figure shows that the set of selected features is both sparse and highly consistent across resampling repetitions. As described in the paper, it afforded the same classification accuracy as the full set. (b) The right figure shows the posterior variance of each model parameter, separately for selected and discarded parameters. The data provide no evidence that the algorithm simply selected those parameters that were easier to fit, as would be indicated by a lower posterior variance (two-tailed t-test, p≈0.640).
Stereogram of the generative score space. Based on the generative score space illustrated in the paper (see right plot in Figure 7), we here show the same plot from two slightly different angles. Readers are invited to try and focus an imaginary point behind the two plots, or use a stereoscope, to recover a fully three‐dimensional impression.
Conceived and designed the experiments: TMS APL KES. Performed the experiments: TMS APL. Analyzed the data: KHB TMS APL CSO EIL JMB KES. Wrote the paper: KHB.
- 1. Friston KJ, Holmes AP, Worsley KJ, Poline JP, Frith CD, et al. (1995) Statistical parametric maps in functional imaging: A general linear approach. Hum Brain Mapp 2: 189–210.KJ FristonAP HolmesKJ WorsleyJP PolineCD Frith1995Statistical parametric maps in functional imaging: A general linear approach.Hum Brain Mapp2189210
- 2. Koutsouleris N, Meisenzahl EM, Davatzikos C, Bottlender R, Frodl T, et al. (2009) Use of neuroanatomical pattern classification to identify subjects in at-risk mental states of psychosis and predict disease transition. Arch Gen Psychiatry 66: 700–712.N. KoutsoulerisEM MeisenzahlC. DavatzikosR. BottlenderT. Frodl2009Use of neuroanatomical pattern classification to identify subjects in at-risk mental states of psychosis and predict disease transition.Arch Gen Psychiatry66700712
- 3. Fu CH, Mourao-Miranda J, Costafreda SG, Khanna A, Marquand AF, et al. (2008) Pattern classification of sad facial processing: Toward the development of neurobiological markers in depression. Biol Psychiatry 63: 656–662.CH FuJ. Mourao-MirandaSG CostafredaA. KhannaAF Marquand2008Pattern classification of sad facial processing: Toward the development of neurobiological markers in depression.Biol Psychiatry63656662
- 4. Shen H, Wang L, Liu Y, Hu D (2010) Discriminative analysis of resting-state functional connectivity patterns of schizophrenia using low dimensional embedding of fMRI. NeuroImage 49: 3110–3121.H. ShenL. WangY. LiuD. Hu2010Discriminative analysis of resting-state functional connectivity patterns of schizophrenia using low dimensional embedding of fMRI.NeuroImage4931103121
- 5. Wang Y, Fan Y, Bhatt P, Davatzikos C (2010) High-dimensional pattern regression using machine learning: From medical images to continuous clinical variables. NeuroImage 50: 1519–1535.Y. WangY. FanP. BhattC. Davatzikos2010High-dimensional pattern regression using machine learning: From medical images to continuous clinical variables.NeuroImage5015191535
- 6. Norman KA, Polyn SM, Detre GJ, Haxby JV (2006) Beyond mind-reading: Multi-voxel pattern analysis of fMRI data. Trends Cogn Sci 10: 424–30.KA NormanSM PolynGJ DetreJV Haxby2006Beyond mind-reading: Multi-voxel pattern analysis of fMRI data.Trends Cogn Sci1042430
- 7. Haynes J, Rees G (2006) Decoding mental states from brain activity in humans. Nat Rev Neurosci 7: 523–534.J. HaynesG. Rees2006Decoding mental states from brain activity in humans.Nat Rev Neurosci7523534
- 8. O'Toole AJ, Jiang F, Abdi H, Penard N, Dunlop JP, et al. (2007) Theoretical, statistical, and practical perspectives on pattern-based classification approaches to the analysis of functional neuroimaging data. J Cogn Neurosci 19: 1735–1752.AJ O'TooleF. JiangH. AbdiN. PenardJP Dunlop2007Theoretical, statistical, and practical perspectives on pattern-based classification approaches to the analysis of functional neuroimaging data.J Cogn Neurosci1917351752
- 9. Friston K, Chu C, Mourao-Miranda J, Hulme O, Rees G, et al. (2008) Bayesian decoding of brain images. NeuroImage 39: 181–205.K. FristonC. ChuJ. Mourao-MirandaO. HulmeG. Rees2008Bayesian decoding of brain images.NeuroImage39181205
- 10. Pereira F, Mitchell T, Botvinick M (2009) Machine learning classifiers and fMRI: A tutorial overview. NeuroImage 45: S199–S209.F. PereiraT. MitchellM. Botvinick2009Machine learning classifiers and fMRI: A tutorial overview.NeuroImage45S199S209
- 11. Ford J, Farid H, Makedon F, Flashman LA, McAllister TW, et al. (2003) Patient classification of fMRI activation maps. Medical Image Computing and Computer-Assisted Intervention. MICCAI. pp. 58–65.J. FordH. FaridF. MakedonLA FlashmanTW McAllister2003Patient classification of fMRI activation maps.Medical Image Computing and Computer-Assisted InterventionMICCAI5865
- 12. Fan Y, Rao H, Hurt H, Giannetta J, Korczykowski M, et al. (2007) Multivariate examination of brain abnormality using both structural and functional MRI. NeuroImage 36: 1189–1199.Y. FanH. RaoH. HurtJ. GiannettaM. Korczykowski2007Multivariate examination of brain abnormality using both structural and functional MRI.NeuroImage3611891199
- 13. Fan Y, Resnick SM, Wu X, Davatzikos C (2008) Structural and functional biomarkers of prodromal Alzheimer's disease: A high-dimensional pattern classification study. NeuroImage 41: 277–285.Y. FanSM ResnickX. WuC. Davatzikos2008Structural and functional biomarkers of prodromal Alzheimer's disease: A high-dimensional pattern classification study.NeuroImage41277285
- 14. Klöppel S, Stonnington CM, Chu C, Draganski B, Scahill RI, et al. (2008) Automatic classification of MR scans in Alzheimer's disease. Brain 131: 681–689.S. KlöppelCM StonningtonC. ChuB. DraganskiRI Scahill2008Automatic classification of MR scans in Alzheimer's disease.Brain131681689
- 15. Klöppel S, Chu C, Tan GC, Draganski B, Johnson H, et al. (2009) Automatic detection of preclinical neurodegeneration: Presymptomatic Huntington disease. Neurology 72: 426–431.S. KlöppelC. ChuGC TanB. DraganskiH. Johnson2009Automatic detection of preclinical neurodegeneration: Presymptomatic Huntington disease.Neurology72426431
- 16. Yoon JH, Tamir D, Minzenberg MJ, Ragland JD, Ursu S, et al. (2008) Multivariate pattern analysis of functional magnetic resonance imaging data reveals deficits in distributed representations in schizophrenia. Biol Psychiatry 64: 1035–1041.JH YoonD. TamirMJ MinzenbergJD RaglandS. Ursu2008Multivariate pattern analysis of functional magnetic resonance imaging data reveals deficits in distributed representations in schizophrenia.Biol Psychiatry6410351041
- 17. Fan Y, Gur RE, Gur RC, Wu X, Shen D, et al. (2008) Unaffected family members and schizophrenia patients share brain structure patterns: A high-dimensional pattern classification study. Biol Psychiatry 63: 118–124.Y. FanRE GurRC GurX. WuD. Shen2008Unaffected family members and schizophrenia patients share brain structure patterns: A high-dimensional pattern classification study.Biol Psychiatry63118124
- 18. Haynes J, Rees G (2005) Predicting the orientation of invisible stimuli from activity in human primary visual cortex. Nat Neurosci 8: 686–691.J. HaynesG. Rees2005Predicting the orientation of invisible stimuli from activity in human primary visual cortex.Nat Neurosci8686691
- 19. Kamitani Y, Tong F (2005) Decoding the visual and subjective contents of the human brain. Nat Neurosci 8: 679–685.Y. KamitaniF. Tong2005Decoding the visual and subjective contents of the human brain.Nat Neurosci8679685
- 20. Cox DD, Savoy RL (2003) Functional magnetic resonance imaging (fMRI) “brain reading”: Detecting and classifying distributed patterns of fMRI activity in human visual cortex. NeuroImage 19: 261–270.DD CoxRL Savoy2003Functional magnetic resonance imaging (fMRI) “brain reading”: Detecting and classifying distributed patterns of fMRI activity in human visual cortex.NeuroImage19261270
- 21. Serences JT, Boynton GM (2007) The representation of behavioral choice for motion in human visual cortex. J Neurosci 27: 12893–12899.JT SerencesGM Boynton2007The representation of behavioral choice for motion in human visual cortex.J Neurosci271289312899
- 22. Davatzikos C, Ruparel K, Fan Y, Shen D, Acharyya M, et al. (2005) Classifying spatial patterns of brain activity with machine learning methods: Application to lie detection. NeuroImage 28: 663–668.C. DavatzikosK. RuparelY. FanD. ShenM. Acharyya2005Classifying spatial patterns of brain activity with machine learning methods: Application to lie detection.NeuroImage28663668
- 23. Kriegeskorte N, Goebel R, Bandettini P (2006) Information-based functional brain mapping. Proc Natl Acad Sci U S A 103: 3863–3868.N. KriegeskorteR. GoebelP. Bandettini2006Information-based functional brain mapping.Proc Natl Acad Sci U S A10338633868
- 24. Haynes J, Sakai K, Rees G, Gilbert S, Frith C, et al. (2007) Reading hidden intentions in the human brain. Curr Biol 17: 323–328.J. HaynesK. SakaiG. ReesS. GilbertC. Frith2007Reading hidden intentions in the human brain.Curr Biol17323328
- 25. Mourao-Miranda J, Bokde A, Born C, Hampel H, Stetter M (2005) Classifying brain states and determining the discriminating activation patterns: Support vector machine on functional MRI data. NeuroImage 28: 980–995.J. Mourao-MirandaA. BokdeC. BornH. HampelM. Stetter2005Classifying brain states and determining the discriminating activation patterns: Support vector machine on functional MRI data.NeuroImage28980995
- 26. Soon C, Namburi P, Goh C, Chee M, Haynes J (2009) Surface-based information detection from cortical activity. NeuroImage 47: S79.C. SoonP. NamburiC. GohM. CheeJ. Haynes2009Surface-based information detection from cortical activity.NeuroImage47S79
- 27. Grosenick L, Klingenberg B, Greer S, Taylor J, Knutson B (2009) Whole-brain sparse penalized discriminant analysis for predicting choice. NeuroImage 47: S58.L. GrosenickB. KlingenbergS. GreerJ. TaylorB. Knutson2009Whole-brain sparse penalized discriminant analysis for predicting choice.NeuroImage47S58
- 28. Kay KN, Naselaris T, Prenger RJ, Gallant JL (2008) Identifying natural images from human brain activity. Nature 452: 352–355.KN KayT. NaselarisRJ PrengerJL Gallant2008Identifying natural images from human brain activity.Nature452352355
- 29. Mitchell TM, Shinkareva SV, Carlson A, Chang K, Malave VL, et al. (2008) Predicting human brain activity associated with the meanings of nouns. Science 320: 1191–1195.TM MitchellSV ShinkarevaA. CarlsonK. ChangVL Malave2008Predicting human brain activity associated with the meanings of nouns.Science32011911195
- 30. Formisano E, De Martino F, Bonte M, Goebel R (2008) “Who” is saying “what”? Brain-based decoding of human voice and speech. Science 322: 970–973.E. FormisanoF. De MartinoM. BonteR. Goebel2008“Who” is saying “what”? Brain-based decoding of human voice and speech.Science322970973
- 31. Chu C, Ni Y, Tan G, Saunders CJ, Ashburner J (2011) Kernel regression for fMRI pattern prediction. NeuroImage 56: 662–673.C. ChuY. NiG. TanCJ SaundersJ. Ashburner2011Kernel regression for fMRI pattern prediction.NeuroImage56662673
- 32. Valente G, De Martino F, Esposito F, Goebel R, Formisano E (2011) Predicting subject-driven actions and sensory experience in a virtual world with Relevance Vector Machine Regression of fMRI data. NeuroImage 56: 651–661.G. ValenteF. De MartinoF. EspositoR. GoebelE. Formisano2011Predicting subject-driven actions and sensory experience in a virtual world with Relevance Vector Machine Regression of fMRI data.NeuroImage56651661
- 33. Mitchell TM, Hutchinson R, Just MA, Niculescu RS, Pereira F, et al. (2003) Classifying instantaneous cognitive states from fMRI data. AMIA Annu Symp Proc 2003: 465–469.TM MitchellR. HutchinsonMA JustRS NiculescuF. Pereira2003Classifying instantaneous cognitive states from fMRI data.AMIA Annu Symp Proc2003465469
- 34. Kamitani Y, Tong F (2006) Decoding seen and attended motion directions from activity in the human visual cortex. Curr Biol 16: 1096–1102.Y. KamitaniF. Tong2006Decoding seen and attended motion directions from activity in the human visual cortex.Curr Biol1610961102
- 35. Hampton AN, O'Doherty JP (2007) Decoding the neural substrates of reward-related decision making with functional MRI. Proc Natl Acad Sci U S A 104: 1377–1382.AN HamptonJP O'Doherty2007Decoding the neural substrates of reward-related decision making with functional MRI.Proc Natl Acad Sci U S A10413771382
- 36. Kriegeskorte N, Formisano E, Sorger B, Goebel R (2007) Individual faces elicit distinct response patterns in human anterior temporal cortex. Proc Natl Acad Sci U S A 104: 20600–20605.N. KriegeskorteE. FormisanoB. SorgerR. Goebel2007Individual faces elicit distinct response patterns in human anterior temporal cortex.Proc Natl Acad Sci U S A1042060020605
- 37. Grosenick L, Greer S, Knutson B (2008) Interpretable classifiers for fMRI improve prediction of purchases. IEEE Trans Neural Syst Rehabil Eng 16: 539–548.L. GrosenickS. GreerB. Knutson2008Interpretable classifiers for fMRI improve prediction of purchases.IEEE Trans Neural Syst Rehabil Eng16539548
- 38. Hassabis D, Chu C, Rees G, Weiskopf N, Molyneux PD, et al. (2009) Decoding neuronal ensembles in the human hippocampus. Curr Biol 19: 546–554.D. HassabisC. ChuG. ReesN. WeiskopfPD Molyneux2009Decoding neuronal ensembles in the human hippocampus.Curr Biol19546554
- 39. Howard JD, Plailly J, Grueschow M, Haynes J, Gottfried JA (2009) Odor quality coding and categorization in human posterior piriform cortex. Nat Neurosci 12: 932–938.JD HowardJ. PlaillyM. GrueschowJ. HaynesJA Gottfried2009Odor quality coding and categorization in human posterior piriform cortex.Nat Neurosci12932938
- 40. Polyn SM, Natu VS, Cohen JD, Norman KA (2005) Category-specific cortical activity precedes retrieval during memory search. Science 310: 1963–1966.SM PolynVS NatuJD CohenKA Norman2005Category-specific cortical activity precedes retrieval during memory search.Science31019631966
- 41. Bode S, Haynes J (2009) Decoding sequential stages of task preparation in the human brain. NeuroImage 45: 606–613.S. BodeJ. Haynes2009Decoding sequential stages of task preparation in the human brain.NeuroImage45606613
- 42. Harrison SA, Tong F (2009) Decoding reveals the contents of visual working memory in early visual areas. Nature 458: 632–635.SA HarrisonF. Tong2009Decoding reveals the contents of visual working memory in early visual areas.Nature458632635
- 43. Craddock RC, III PEH, Hu XP, Mayberg HS (2009) Disease state prediction from resting state functional connectivity. Magn Reson Med 62: 1619–1628.RC CraddockPEH IIIXP HuHS Mayberg2009Disease state prediction from resting state functional connectivity.Magn Reson Med6216191628
- 44. Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press. J. Shawe-TaylorN. Cristianini2004Kernel methods for pattern analysis.Cambridge University Press
- 45. Friston KJ, Harrison L, Penny W (2003) Dynamic causal modelling. NeuroImage 19: 1273–1302.KJ FristonL. HarrisonW. Penny2003Dynamic causal modelling.NeuroImage1912731302
- 46. Stephan KE, Kasper L, Harrison LM, Daunizeau J, den Ouden HE, et al. (2008) Nonlinear dynamic causal models for fMRI. NeuroImage 42: 649–662.KE StephanL. KasperLM HarrisonJ. DaunizeauHE den Ouden2008Nonlinear dynamic causal models for fMRI.NeuroImage42649662
- 47. Stephan KE, Friston KJ, Frith CD (2009) Dysconnection in schizophrenia: From abnormal synaptic plasticity to failures of self-monitoring. Schizophr Bull 35: 509–527.KE StephanKJ FristonCD Frith2009Dysconnection in schizophrenia: From abnormal synaptic plasticity to failures of self-monitoring.Schizophr Bull35509527
- 48. Castren E (2005) Is mood chemistry? Nat Rev Neurosci 6: 241–246.E. Castren2005Is mood chemistry?Nat Rev Neurosci6241246
- 49. den Ouden HEM, Daunizeau J, Roiser J, Friston KJ, Stephan KE (2010) Striatal prediction error modulates cortical coupling. J Neurosci 30: 3210–3219.HEM den OudenJ. DaunizeauJ. RoiserKJ FristonKE Stephan2010Striatal prediction error modulates cortical coupling.J Neurosci3032103219
- 50. Müller KR, Mika S, Ratsch G, Tsuda K, Schölkopf B (2001) An introduction to kernel-based learning algorithms. IEEE Trans Neural Netw 12: 181–201.KR MüllerS. MikaG. RatschK. TsudaB. Schölkopf2001An introduction to kernel-based learning algorithms.IEEE Trans Neural Netw12181201
- 51. Schölkopf B, Smola AJ (2002) Learning with kernels: Support vector machines, regularization, optimization, and beyond. MIT Press. B. SchölkopfAJ Smola2002Learning with kernels: Support vector machines, regularization, optimization, and beyond.MIT Press
- 52. Haussler D (1999) Convolution kernels on discrete structures. D. Haussler1999Convolution kernels on discrete structures.UCSC-CRL-99-10. Available: http://www.cbse.ucsc.edu/sites/default/files/convolutions.pdf. UCSC-CRL-99-10. Available: http://www.cbse.ucsc.edu/sites/default/files/convolutions.pdf.
- 53. Jaakkola TS, Haussler D (1999) Exploiting generative models in discriminative classifiers. Advances in Neural Information Processing Systems. pp. 487–493.TS JaakkolaD. Haussler1999Exploiting generative models in discriminative classifiers.Advances in Neural Information Processing Systems487493Proceedings of the Tenth Conference on Advances in Neural Information Processing Systems. Proceedings of the Tenth Conference on Advances in Neural Information Processing Systems.
- 54. Bicego M, Murino V, Figueiredo MA (2004) Similarity-based classification of sequences using hidden Markov models. Pattern Recognit 37: 2281–2291.M. BicegoV. MurinoMA Figueiredo2004Similarity-based classification of sequences using hidden Markov models.Pattern Recognit3722812291
- 55. Jebara T, Kondor R, Howard A (2004) Probability product kernels. J Mach Learn Res 5: 844.T. JebaraR. KondorA. Howard2004Probability product kernels.J Mach Learn Res5844
- 56. Hein M, Bousquet O (2004) Hilbertian metrics and positive definite kernels on probability measures. Proc AI Statistics 10: 136–143.M. HeinO. Bousquet2004Hilbertian metrics and positive definite kernels on probability measures.Proc AI Statistics10136143
- 57. Cuturi M, Fukumizu K, Vert J (2006) Semigroup kernels on measures. J Mach Learn Res 6: 1169.M. CuturiK. FukumizuJ. Vert2006Semigroup kernels on measures.J Mach Learn Res61169
- 58. Bosch A, Zisserman A, Munoz X (2006) Scene classification via pLSA. Proc ECCV 4: 517–530.A. BoschA. ZissermanX. Munoz2006Scene classification via pLSA.Proc ECCV4517530
- 59. Bosch A, Zisserman A, Pujol M, Muoz X (2008) Scene classification using a hybrid generative/discriminative approach. IEEE Trans Pattern Anal Mach Intell 30: 712–727.A. BoschA. ZissermanM. PujolX. Muoz2008Scene classification using a hybrid generative/discriminative approach.IEEE Trans Pattern Anal Mach Intell30712727
- 60. Bicego M, Pekalska E, Tax DM, Duin RP (2009) Component-based discriminative classification for hidden Markov models. Pattern Recognit 42: 2637–2648.M. BicegoE. PekalskaDM TaxRP Duin2009Component-based discriminative classification for hidden Markov models.Pattern Recognit4226372648
- 61. Brodersen KH, Haiss F, Ong C, Jung F, Tittgemeyer M, et al. (2011) Model-based feature construction for multivariate decoding. NeuroImage 56: 601–615.KH BrodersenF. HaissC. OngF. JungM. Tittgemeyer2011Model-based feature construction for multivariate decoding.NeuroImage56601615
- 62. Smith N, Niranjan M (2000) Data-dependent kernels in SVM classification of speech patterns. Proceedings of the 6th International Conference on Spoken Language Processing Beijing, China. pp. 297–300.N. SmithM. Niranjan2000Data-dependent kernels in SVM classification of speech patterns.Proceedings of the 6th International Conference on Spoken Language Processing Beijing, China297300
- 63. Holub AD, Welling M, Perona P (2005) Combining generative models and fisher kernels for object recognition. IEEE International Conference on Computer Vision. Los Alamitos, CA, USA: IEEE Computer Society. pp. 136–143.AD HolubM. WellingP. Perona2005Combining generative models and fisher kernels for object recognition.IEEE International Conference on Computer VisionLos Alamitos, CA, USAIEEE Computer Society136143
- 64. Jaakkola T, Diekhans M, Haussler D (1999) Using the Fisher kernel method to detect remote protein homologies. Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology. AAAI Press. pp. 149–158.T. JaakkolaM. DiekhansD. Haussler1999Using the Fisher kernel method to detect remote protein homologies.Proceedings of the 7th International Conference on Intelligent Systems for Molecular BiologyAAAI Press149158
- 65. Bicego M, Cristani M, Murino V, Pekalska E, Duin R (2009) Clustering-based construction of hidden Markov models for generative kernels. Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition. Heidelberg: Springer-Verlag Berlin. pp. 466–479.M. BicegoM. CristaniV. MurinoE. PekalskaR. Duin2009Clustering-based construction of hidden Markov models for generative kernels.Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern RecognitionHeidelbergSpringer-Verlag Berlin466479
- 66. Hofmann T (2000) Learning the similarity of documents: An information-geometric approach to document retrieval and categorization. In: Solla SA, Leen TK, Müller KR, editors. Advances in Neural Information Processing Systems 12. MIT Press. pp. 914–920.T. Hofmann2000Learning the similarity of documents: An information-geometric approach to document retrieval and categorization.SA SollaTK LeenKR MüllerAdvances in Neural Information Processing Systems 12MIT Press914920
- 67. Minka T (2005) Discriminative models, not discriminative training. Microsoft Research. T. Minka2005Discriminative models, not discriminative training. Microsoft Research.Available at: ftp://ftp.research.microsoft.com/pub/tr/TR-2005-144.pdf. Available at: ftp://ftp.research.microsoft.com/pub/tr/TR-2005-144.pdf.
- 68. Lasserre JA, Bishop CM, Minka TP (2006) Principled hybrids of generative and discriminative models. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Los Alamitos, CA, USA: IEEE Computer Society. pp. 87–94.JA LasserreCM BishopTP Minka2006Principled hybrids of generative and discriminative models.IEEE Computer Society Conference on Computer Vision and Pattern RecognitionLos Alamitos, CA, USAIEEE Computer Society8794
- 69. Perina A, Cristani M, Castellani U, Murino V, Jojic N (2010) A hybrid generative/discriminative classification framework based on free-energy terms. IEEE 12th International Conference on Computer Vision. Kyoto, Japan: pp. 2058–2065.A. PerinaM. CristaniU. CastellaniV. MurinoN. Jojic2010A hybrid generative/discriminative classification framework based on free-energy terms.IEEE 12th International Conference on Computer VisionKyoto, Japan2058206529 Sept-2 Oct 2009;. 29 Sept-2 Oct 2009;.
- 70. Martins A, Bicego M, Murino V, Aguiar P, Figueiredo M (2010) Information theoretical kernels for generative embeddings based on Hidden Markov Models. Structural Syntactic and Statistical Pattern Recognition. Izmir, Turkey: pp. 463–472.A. MartinsM. BicegoV. MurinoP. AguiarM. Figueiredo2010Information theoretical kernels for generative embeddings based on Hidden Markov Models.Structural Syntactic and Statistical Pattern RecognitionIzmir, Turkey4634722010:. 2010:.
- 71. Leff AP, Schofield TM, Stephan KE, Crinion JT, Friston KJ, et al. (2008) The cortical dynamics of intelligible speech. J Neurosci 28: 13209–13215.AP LeffTM SchofieldKE StephanJT CrinionKJ Friston2008The cortical dynamics of intelligible speech.J Neurosci281320913215
- 72. Boser BE, Guyon IM, Vapnik VN (1992) A training algorithm for optimal margin classifiers. Proceedings of the 5th Annual Workshop on Computational Learning Theory. pp. 144–152.BE BoserIM GuyonVN Vapnik1992A training algorithm for optimal margin classifiers.Proceedings of the 5th Annual Workshop on Computational Learning Theory144152
- 73. Ben-Hur A, Ong CS, Sonnenburg S, Schölkopf B, Rätsch G (2008) Support Vector Machines and Kernels for Computational Biology. PLoS Comput Biol 4: e1000173.A. Ben-HurCS OngS. SonnenburgB. SchölkopfG. Rätsch2008Support Vector Machines and Kernels for Computational Biology.PLoS Comput Biol4e1000173
- 74. Zhang T (2009) Some sharp performance bounds for least squares regression with L1 regularization. Ann Stat 37: 2109–2144.T. Zhang2009Some sharp performance bounds for least squares regression with L1 regularization.Ann Stat3721092144
- 75. Peleg D, Meir R (2008) A bilinear formulation for vector sparsity optimization. Signal Process 88: 375–389.D. PelegR. Meir2008A bilinear formulation for vector sparsity optimization.Signal Process88375389
- 76. Mercer J (1909) Functions of positive and negative type, and their connection with the theory of integral equations. Proc R Soc Lond A Math Phys Sci 209: 415–446.J. Mercer1909Functions of positive and negative type, and their connection with the theory of integral equations.Proc R Soc Lond A Math Phys Sci209415446
- 77. David O, Kiebel SJ, Harrison LM, Mattout J, Kilner JM, et al. (2006) Dynamic causal modeling of evoked responses in EEG and MEG. NeuroImage 30: 1255–1272.O. DavidSJ KiebelLM HarrisonJ. MattoutJM Kilner2006Dynamic causal modeling of evoked responses in EEG and MEG.NeuroImage3012551272
- 78. Moran RJ, Stephan KE, Seidenbecher T, Pape H, Dolan RJ, et al. (2009) Dynamic causal models of steady-state responses. NeuroImage 44: 796–811.RJ MoranKE StephanT. SeidenbecherH. PapeRJ Dolan2009Dynamic causal models of steady-state responses.NeuroImage44796811
- 79. Chen CC, Kiebel SJ, Friston KJ (2008) Dynamic causal modelling of induced responses. NeuroImage 41: 1293–1312.CC ChenSJ KiebelKJ Friston2008Dynamic causal modelling of induced responses.NeuroImage4112931312
- 80. Daunizeau J, Kiebel SJ, Friston KJ (2009) Dynamic causal modelling of distributed electromagnetic responses. NeuroImage 47: 590–601.J. DaunizeauSJ KiebelKJ Friston2009Dynamic causal modelling of distributed electromagnetic responses.NeuroImage47590601
- 81. Roebroeck A, Formisano E, Goebel R (2005) Mapping directed influence over the brain using Granger causality and fMRI. NeuroImage 25: 230–242.A. RoebroeckE. FormisanoR. Goebel2005Mapping directed influence over the brain using Granger causality and fMRI.NeuroImage25230242
- 82. Stephan KE, Harrison LM, Kiebel SJ, David O, Penny WD, et al. (2007) Dynamic causal models of neural system dynamics: Current state and future extensions. J Biosci 32: 129–44.KE StephanLM HarrisonSJ KiebelO. DavidWD Penny2007Dynamic causal models of neural system dynamics: Current state and future extensions.J Biosci3212944
- 83. Stephan KE, Weiskopf N, Drysdale PM, Robinson PA, Friston KJ (2007) Comparing hemodynamic models with DCM. NeuroImage 38: 387–401.KE StephanN. WeiskopfPM DrysdalePA RobinsonKJ Friston2007Comparing hemodynamic models with DCM.NeuroImage38387401
- 84. Kiebel SJ, David O, Friston KJ (2006) Dynamic causal modelling of evoked responses in EEG/MEG with lead field parameterization. NeuroImage 30: 1273–1284.SJ KiebelO. DavidKJ Friston2006Dynamic causal modelling of evoked responses in EEG/MEG with lead field parameterization.NeuroImage3012731284
- 85. Friston KJ (2002) Bayesian estimation of dynamical systems: An application to fMRI. NeuroImage 16: 513–530.KJ Friston2002Bayesian estimation of dynamical systems: An application to fMRI.NeuroImage16513530
- 86. Friston K, Mattout J, Trujillo-Barreto N, Ashburner J, Penny W (2007) Variational free energy and the Laplace approximation. NeuroImage 34: 220–234.K. FristonJ. MattoutN. Trujillo-BarretoJ. AshburnerW. Penny2007Variational free energy and the Laplace approximation.NeuroImage34220234
- 87. Stephan K, Penny W, Moran R, den Ouden H, Daunizeau J, et al. (2010) Ten simple rules for dynamic causal modeling. NeuroImage 49: 3099–3109.K. StephanW. PennyR. MoranH. den OudenJ. Daunizeau2010Ten simple rules for dynamic causal modeling.NeuroImage4930993109
- 88. Stephan KE, Penny WD, Daunizeau J, Moran RJ, Friston KJ (2009) Bayesian model selection for group studies. NeuroImage 46: 1004–1017.KE StephanWD PennyJ. DaunizeauRJ MoranKJ Friston2009Bayesian model selection for group studies.NeuroImage4610041017
- 89. Penny WD, Stephan KE, Mechelli A, Friston KJ (2004) Comparing dynamic causal models. NeuroImage 22: 1157–1172.WD PennyKE StephanA. MechelliKJ Friston2004Comparing dynamic causal models.NeuroImage2211571172
- 90. Stone M (1974) Cross-validatory choice and assessment of statistical predictions. J R Stat Soc Series B Stat Methodol. pp. 111–147.M. Stone1974Cross-validatory choice and assessment of statistical predictions.J R Stat Soc Series B Stat Methodol111147
- 91. Cawley GC, Talbot NLC (2010) On over-fitting in model selection and subsequent selection bias in performance evaluation. J Mach Learn Res 11: 2079–2107.GC CawleyNLC Talbot2010On over-fitting in model selection and subsequent selection bias in performance evaluation.J Mach Learn Res1120792107
- 92. Brodersen KH, Ong CS, Stephan KE, Buhmann JM (2010) The balanced accuracy and its posterior distribution. Proceedings of the 20th International Conference on Pattern Recognition. IEEE Computer Society. pp. 3121–3124.KH BrodersenCS OngKE StephanJM Buhmann2010The balanced accuracy and its posterior distribution.Proceedings of the 20th International Conference on Pattern RecognitionIEEE Computer Society31213124
- 93. Swinburn K, Porter G, Howard D (2004) Comprehensive Aphasia Test. New York: Psychology Press. K. SwinburnG. PorterD. Howard2004Comprehensive Aphasia Test.New YorkPsychology Press
- 94. Raftery AE (1995) Bayesian model selection in social research. Sociol Methodol 25: 111–163.AE Raftery1995Bayesian model selection in social research.Sociol Methodol25111163
- 95. Friston KJ, Stephan KE, Lund TE, Morcom A, Kiebel S (2005) Mixed-effects and fMRI studies. NeuroImage 24: 244–252.KJ FristonKE StephanTE LundA. MorcomS. Kiebel2005Mixed-effects and fMRI studies.NeuroImage24244252
- 96. Fisher RA (1915) Frequency Distribution of the Values of the Correlation Coefficient in Samples from an Indefinitely Large Population. Biometrika 10: 507–521.RA Fisher1915Frequency Distribution of the Values of the Correlation Coefficient in Samples from an Indefinitely Large Population.Biometrika10507521
- 97. Brodersen KH, Ong CS, Stephan KE, Buhmann JM (2010) The binormal assumption on precision-recall curves. Proceedings of the 20th International Conference on Pattern Recognition. IEEE Computer Society. pp. 4263–4266.KH BrodersenCS OngKE StephanJM Buhmann2010The binormal assumption on precision-recall curves.Proceedings of the 20th International Conference on Pattern RecognitionIEEE Computer Society42634266
- 98. Passingham RE, Stephan KE, Kotter R (2002) The anatomical basis of functional localization in the cortex. Nat Rev Neurosci 3: 606–616.RE PassinghamKE StephanR. Kotter2002The anatomical basis of functional localization in the cortex.Nat Rev Neurosci3606616
- 99. Scott DW (1992) Kernel density estimators. Multivariate Density Estimation: Theory, Practice, and Visualization. Wiley. DW Scott1992Kernel density estimators.Multivariate Density Estimation: Theory, Practice, and VisualizationWiley
- 100. Stephan KE, Marshall JC, Penny WD, Friston KJ, Fink GR (2007) Interhemispheric integration of visual processing during task-driven lateralization. J Neurosci 27: 3512–3522.KE StephanJC MarshallWD PennyKJ FristonGR Fink2007Interhemispheric integration of visual processing during task-driven lateralization.J Neurosci2735123522
- 101. Price CJ (2010) The anatomy of language: a review of 100 fMRI studies published in 2009. Ann N Y Acad Sci 1191: 62–88.CJ Price2010The anatomy of language: a review of 100 fMRI studies published in 2009.Ann N Y Acad Sci11916288
- 102. Dehaene S, Pegado F, Braga LW, Ventura P, Nunes Filho G, et al. (2010) How learning to read changes the cortical networks for vision and language. Science 330: 1359–1364.S. DehaeneF. PegadoLW BragaP. VenturaG. Nunes Filho2010How learning to read changes the cortical networks for vision and language.Science33013591364
- 103. Lao Z, Shen D, Xue Z, Karacali B, Resnick SM, et al. (2004) Morphological classification of brains via high-dimensional shape transformations and machine learning methods. NeuroImage 21: 46–57.Z. LaoD. ShenZ. XueB. KaracaliSM Resnick2004Morphological classification of brains via high-dimensional shape transformations and machine learning methods.NeuroImage214657
- 104. Thomaz CE, Boardman JP, Hill DL, Hajnal JV, Edwards DD, et al. (2004) Using a maximum uncertainty LDA-based approach to classify and analyse MR brain images. 7th International Conference on Medical Image Computing and Computer-Assisted Intervention. Springer-Verlag Berlin. pp. 291–300.CE ThomazJP BoardmanDL HillJV HajnalDD Edwards2004Using a maximum uncertainty LDA-based approach to classify and analyse MR brain images.7th International Conference on Medical Image Computing and Computer-Assisted InterventionSpringer-Verlag Berlin291300
- 105. MacKay DJC (1992) Bayesian interpolation. Neural Comput 4: 415–447.DJC MacKay1992Bayesian interpolation.Neural Comput4415447
- 106. Allen P, Stephan KE, Mechelli A, Day F, Ward N, et al. (2010) Cingulate activity and fronto-temporal connectivity in people with prodromal signs of psychosis. NeuroImage 49: 947–955.P. AllenKE StephanA. MechelliF. DayN. Ward2010Cingulate activity and fronto-temporal connectivity in people with prodromal signs of psychosis.NeuroImage49947955
- 107. Davatzikos C, Fan Y, Wu X, Shen D, Resnick SM (2008) Detection of prodromal Alzheimer's disease via pattern classification of magnetic resonance imaging. Neurobiol Aging 29: 514–523.C. DavatzikosY. FanX. WuD. ShenSM Resnick2008Detection of prodromal Alzheimer's disease via pattern classification of magnetic resonance imaging.Neurobiol Aging29514523
- 108. Davatzikos C, Resnick S, Wu X, Parmpi P, Clark C (2008) Individual patient diagnosis of AD and FTD via high-dimensional pattern classification of MRI. NeuroImage 41: 1220–1227.C. DavatzikosS. ResnickX. WuP. ParmpiC. Clark2008Individual patient diagnosis of AD and FTD via high-dimensional pattern classification of MRI.NeuroImage4112201227
- 109. Misra C, Fan Y, Davatzikos C (2009) Baseline and longitudinal patterns of brain atrophy in MCI patients, and their use in prediction of short-term conversion to AD: Results from ADNI. NeuroImage 44: 1415–1422.C. MisraY. FanC. Davatzikos2009Baseline and longitudinal patterns of brain atrophy in MCI patients, and their use in prediction of short-term conversion to AD: Results from ADNI.NeuroImage4414151422
- 110. Nenadic I, Sauer H, Gaser C (2010) Distinct pattern of brain structural deficits in subsyndromes of schizophrenia delineated by psychopathology. NeuroImage 49: 1153–1160.I. NenadicH. SauerC. Gaser2010Distinct pattern of brain structural deficits in subsyndromes of schizophrenia delineated by psychopathology.NeuroImage4911531160