Comparing within-subject classification and regularization methods in fMRI for large and small sample sizes
TL;DR: It is shown that the classifier model has a small impact on signal detection, compared to the choice of regularizer, and trends in classifier performance are consistent across task contrasts and data sizes, and are consistent for ROI‐based classifier analyses.
read more
Abstract: In recent years, a variety of multivariate classifier models have been applied to fMRI, with different modeling assumptions. When classifying high-dimensional fMRI data, we must also regularize to improve model stability, and the interactions between classifier and regularization techniques are still being investigated. Classifiers are usually compared on large, multisubject fMRI datasets. However, it is unclear how classifier/regularizer models perform for within-subject analyses, as a function of signal strength and sample size. We compare four standard classifiers: Linear and Quadratic Discriminants, Logistic Regression and Support Vector Machines. Classification was performed on data in the linear kernel (covariance) feature space, and classifiers are tuned with four commonly-used regularizers: Principal Component and Independent Component Analysis, and penalization of kernel features using L1 and L2 norms. We evaluated prediction accuracy (P) and spatial reproducibility (R) of all classifier/regularizer combinations on single-subject analyses, over a range of three different block task contrasts and sample sizes for a BOLD fMRI experiment. We show that the classifier model has a small impact on signal detection, compared to the choice of regularizer. PCA maximizes reproducibility and global SNR, whereas Lp-norms tend to maximize prediction. ICA produces low reproducibility, and prediction accuracy is classifier-dependent. However, trade-offs in (P,R) depend partly on the optimization criterion, and PCA-based models are able to explore the widest range of (P,R) values. These trends are consistent across task contrasts and data sizes (training samples range from 6 to 96 scans). In addition, the trends in classifier performance are consistent for ROI-based classifier analyses. Hum Brain Mapp 35:4499–4517, 2014. © 2014 Wiley Periodicals, Inc.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Assessing and tuning brain decoders: cross-validation, caveats, and guidelines
Gaël Varoquaux,Pradeep Reddy Raamana,Denis A. Engemann,Andrés Hoyos-Idrobo,Yannick Schwartz,Bertrand Thirion +5 more
TL;DR: T theory and experiments outline that the popular “leave‐one‐out” strategy leads to unstable and biased estimates, and a repeated random splits method should be preferred, and it can be favorable to use sane defaults, in particular for non‐sparse decoders.
763
How many is enough? effect of sample size in inter-subject correlation analysis of fMRI
Juha Pajula,Jussi Tohka +1 more
TL;DR: The findings suggested that with 20 subjects, on average, the ISC statistics had converged close to a large sample ISC statistic with 130 subjects, however, the split-half reliability of unthresholded and thresholded ISC maps improved notably when the number of subjects was increased from 20 to 30 or more.
Putting Psychology to the Test: Rethinking Model Evaluation Through Benchmarking and Prediction:
Roberta Rocca,Roberta Rocca,Tal Yarkoni +2 more
- 23 Sep 2021
TL;DR: In psychology, relatively little focus has been placed on defining reliable communal met... as discussed by the authors, although consensus on standards for evaluating models and theories is an integral part of every science in psychology.
50
Linear Discriminant Analysis Achieves High Classification Accuracy for the BOLD fMRI Response to Naturalistic Movie Stimuli
TL;DR: Several classification algorithms known as Nearest Neighbor (NN), Gaussian Naïve Bayes (GNB), and (regularized) Linear Discriminant Analysis (LDA) are compared in terms of their classification accuracy in discriminating the global fMRI response patterns evoked by a large number of naturalistic visual stimuli presented as a movie.
Building predictive models of emotion with functional near-infrared spectroscopy
TL;DR: The capability of discriminating between affective states on the valence and arousal dimensions using functional near-infrared spectroscopy (fNIRS), a practical non-invasive device that benefits from its ability to localize activation in functional brain regions with spatial resolution superior to the Electroencephalograph (EEG).
43
References
Regularization and variable selection via the elastic net
Hui Zou,Trevor Hastie +1 more
TL;DR: It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lamba.
Independent component analysis: algorithms and applications
Aapo Hyvärinen,Erkki Oja +1 more
TL;DR: The basic theory and applications of ICA are presented, and the goal is to find a linear representation of non-Gaussian data so that the components are statistically independent, or as independent as possible.
9.7K
Least angle regression
Bradley Efron,Trevor Hastie,Iain M. Johnstone,Robert Tibshirani,Hemant Ishwaran,Keith Knight,Jean-Michel Loubes,Jean-Michel Loubes,Pascal Massart,Pascal Massart,David Madigan,David Madigan,Greg Ridgeway,Greg Ridgeway,Saharon Rosset,Saharon Rosset,Ji Zhu,Robert A. Stine,Berwin A. Turlach,Sanford Weisberg +19 more
TL;DR: A publicly available algorithm that requires only the same order of magnitude of computational effort as ordinary least squares applied to the full set of covariates is described.
•Book
An Introduction to Support Vector Machines
Nello Cristianini,John Shawe-Taylor +1 more
- 01 Mar 2000
TL;DR: This book is the first comprehensive introduction to Support Vector Machines, a new generation learning system based on recent advances in statistical learning theory, and introduces Bayesian analysis of learning and relates SVMs to Gaussian Processes and other kernel based learning methods.