Graph classification and clustering based on vector space embedding.
From MaRDI portal
Recommendations
Cited in
(16)- Fast depth-based subgraph kernels for unattributed graphs
- Approximation of graph edit distance based on Hausdorff matching
- Fuzzy multilevel graph embedding
- Discriminative prototype selection methods for graph embedding
- Graph based analysis for gene segment organization in a scrambled genome
- Hierarchical graph embedding in vector space by graph pyramid
- Graph characterization by counting sink star subgraphs
- Distances between sets based on set commonality
- The graph matching problem
- Graph ambiguity
- Graph embedding for pattern analysis.
- A comparison of explicit and implicit graph embedding methods for pattern recognition
- A nested alignment graph kernel through the dynamic time warping framework
- Classification on large networks: a quantitative bound via motifs and graphons (research)
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Graph-Theoretic Techniques for Web Content Mining
This page was built for publication: Graph classification and clustering based on vector space embedding.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557987)