Graph Embedding in Vector Spaces by Means of Prototype Selection
From MaRDI portal
Publication:5325758
Recommendations
Cited in
(17)- A long trip in the charming world of graphs for pattern recognition
- Fuzzy multilevel graph embedding
- Discriminative prototype selection methods for graph embedding
- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- Spectral graph features for the classification of graphs and graph sequences
- Hierarchical graph embedding in vector space by graph pyramid
- Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
- A new protein graph model for function prediction
- Dimensionality reduction for graph of words embedding
- Incremental embedding within a dissimilarity-based framework
- Graph classification and clustering based on vector space embedding.
- A Recursive Embedding Approach to Median Graph Computation
- A comparison of explicit and implicit graph embedding methods for pattern recognition
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Recent advances in graph-based pattern recognition with applications in document analysis
- Graph embedding using tree edit-union
- Generalized median graph computation by means of graph embedding in vector spaces
This page was built for publication: Graph Embedding in Vector Spaces by Means of Prototype Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325758)