ArticleThe annals of applied statistics2019
NETWORK CLASSIFICATION WITH APPLICATIONS TO BRAIN CONNECTOMICS.
Article in The annals of applied statistics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 papers, 1 of them a synthesis that pooled it.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
16 citing papers in PubMed, 1 synthesis or guideline pooled it.
- Structural covariance networks in schizophrenia: A systematic review Part II.Schizophrenia research · 2022Pooled it
- Latent space-based network analysis for brain-behavior linking in neuroimaging.Nature methods · 2026Article
- Classification of psychosis spectrum disorders using graph convolutional networks with structurally constrained functional connectomes.Neural networks : the official journal of the International Neural Network Society · 2025Article
- Brain network fingerprints of Alzheimer's disease risk factors in mouse models with humanized APOE alleles.Magnetic resonance imaging · 2024Article
- APOE, Immune Factors, Sex, and Diet Interact to Shape Brain Networks in Mouse Models of Aging.bioRxiv : the preprint server for biology · 2024Article
- netANOVA: novel graph clustering technique with significance assessment via hierarchical ANOVA.Briefings in bioinformatics · 2023Article
- A Novel Temporal Network-Embedding Algorithm for Link Prediction in Dynamic Networks.Entropy (Basel, Switzerland) · 2023Article
- Genetic underpinnings of brain structural connectome for young adults.Journal of the American Statistical Association · 2023Article
- A practical two-sample test for weighted random graphs.Journal of applied statistics · 2023Article
- Single-index models with functional connectivity network predictors.Biostatistics (Oxford, England) · 2022Article
- SCALAR ON NETWORK REGRESSION VIA BOOSTING.The annals of applied statistics · 2022Article
- Semi-parametric Bayes regression with network-valued covariates.Machine learning · 2022Article
- Bayesian network mediation analysis with application to the brain functional connectome.Statistics in medicine · 2022Article
- Statistical and Machine Learning Link Selection Methods for Brain Functional Networks: Review and Comparison.Brain sciences · 2021Article
- Inference for Multiple Heterogeneous Networks with a Common Invariant Subspace.Journal of machine learning research : JMLR · 2021Article
- Learning Clique Subgraphs in Structural Brain Network Classification with Application to Crystallized Cognition.NeuroImage · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
While statistical analysis of a single network has received a lot of attention in recent years, with a focus on social networks, analysis of a sample of networks presents its own challenges which require a different set of analytic tools. Here we study the problem of classification of networks with labeled nodes, motivated by applications in neuroimaging. Brain networks are constructed from imaging data to represent functional connectivity between regions of the brain, and previous work has shown the potential of such networks to distinguish between various brain disorders, giving rise to a network classification problem. Existing approaches tend to either treat all edge weights as a long vector, ignoring the network structure, or focus on graph topology as represented by summary measures while ignoring the edge weights. Our goal is to design a classification method that uses both the individual edge information and the network structure of the data in a computationally efficient way, and that can produce a parsimonious and interpretable representation of differences in brain connectivity patterns between classes. We propose a graph classification method that uses edge weights as predictors but incorporates the network nature of the data via penalties that promote sparsity in the number of nodes, in addition to the usual sparsity penalties that encourage selection of edges. We implement the method via efficient convex optimization and provide a detailed analysis of data from two fMRI studies of schizophrenia.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.