(Hyper)Graph Embedding and Classification via Simplicial Complexes

(Hyper)Graph Embedding and Classification via Simplicial Complexes

This paper investigates a novel graph embedding procedure based on simplicial complexes. Inherited from algebraic topology, simplicial complexes are collections of increasing-order simplices (e.g., points, lines, triangles, tetrahedrons) which can be interpreted as possibly meaningful substructures...

Full description

Bibliographic Details
Main Authors: Alessio Martino, Alessandro Giuliani, Antonello Rizzi
Format: Article
Language:English
Published: MDPI AG 2019-10-01
Series:Algorithms
Subjects:
granular computing
embedding spaces
graph embedding
topological data analysis
simplicial complexes
computational biology
protein contact networks
complex networks
complex systems
Online Access:https://www.mdpi.com/1999-4893/12/11/223

Internet

https://www.mdpi.com/1999-4893/12/11/223

Similar Items