Shuffled graph classification: theory and connectome applications
From MaRDI portal
Abstract: We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are called shuffled graphs. Our formalism provides insight to trivially answer a number of open statistical questions including: (i) under what conditions does shuffling the vertices degrade classification performance and (ii) do universally consistent graph classifiers exist? The answers to these questions lead to practical heuristic algorithms with state-of-the-art finite sample performance, in agreement with our theoretical asymptotics.
Recommendations
- Network classification with applications to brain connectomics
- Classification on large networks: a quantitative bound via motifs and graphons (research)
- Machine learning application to human brain network studies: a kernel approach
- Seeded graph matching for correlated Erdős-Rényi graphs
- Universally consistent vertex classification for latent positions graphs
Cites work
- Consistent nonparametric regression. Discussion
- Discriminative prototype selection methods for graph embedding
- gBoost: a mathematical programming approach to graph classification and regression
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 5032032 (Why is no real title available?)
Cited in
(7)- Network classification with applications to brain connectomics
- Machine learning application to human brain network studies: a kernel approach
- Universally consistent vertex classification for latent positions graphs
- Classification on large networks: a quantitative bound via motifs and graphons (research)
- A class of doubly stochastic shift operators for random graph signals and their boundedness
- High-dimensional Bayesian network classification with network global-local shrinkage priors
- Lost in the shuffle: testing power in the presence of errorful network vertex labels
This page was built for publication: Shuffled graph classification: theory and connectome applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353142)
