Statistical graph space analysis
From MaRDI portal
Publication:2417832
Recommendations
Cites work
- A survey of graph edit distance
- An eigendecomposition approach to weighted graph matching problems
- Asymmetric graphs
- Benchmarking optimization software with performance profiles.
- Central clustering of attributed graphs
- Constellations and the Unsupervised Learning of Graphs
- Generalized median graph computation by means of graph embedding in vector spaces
- Generalized median graphs and applications
- scientific article; zbMATH DE number 5668397 (Why is no real title available?)
- scientific article; zbMATH DE number 1194132 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 2043370 (Why is no real title available?)
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- scientific article; zbMATH DE number 2043372 (Why is no real title available?)
- scientific article; zbMATH DE number 3053873 (Why is no real title available?)
- Large sample theory of intrinsic and extrinsic sample means on manifolds. I
- Nonparametric inference on manifolds. With applications to shape spaces
- Object oriented data analysis: sets of trees
- Overview of object oriented data analysis
- Protein classification by matching and clustering surface graphs
- Self-organizing map for clustering in the graph domain
- Self-organizing maps.
- Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces
- The graph matching problem
- Weighted mean of a pair of graphs
Cited in
(9)- A quotient space formulation for generative statistical analysis of graphical data
- The Fréchet mean of inhomogeneous random graphs
- Averages of unlabeled networks: geometric characterization and asymptotic behavior
- Sufficient conditions for the existence of a sample mean of time series under dynamic time warping
- Model-free two-sample test for network-valued data
- Support measures for graph data
- Graph space: using both geometric and probabilistic structure to evaluate statistical graph models
- An average-compress algorithm for the sample mean problem under dynamic time warping
- Theoretical analysis and computation of the sample Fréchet mean of sets of large graphs for various metrics
This page was built for publication: Statistical graph space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417832)