Cargando…
(Hyper)graph Kernels over Simplicial Complexes
Graph kernels are one of the mainstream approaches when dealing with measuring similarity between graphs, especially for pattern recognition and machine learning tasks. In turn, graphs gained a lot of attention due to their modeling capabilities for several real-world phenomena ranging from bioinfor...
Autores principales: | Martino, Alessio, Rizzi, Antonello |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597323/ https://www.ncbi.nlm.nih.gov/pubmed/33286924 http://dx.doi.org/10.3390/e22101155 |
Ejemplares similares
-
Simplicial complexes of graphs
por: Jonsson, Jakob
Publicado: (2008) -
Stability of synchronization in simplicial complexes
por: Gambuzza, L. V., et al.
Publicado: (2021) -
Random walks on simplicial complexes and harmonics
por: Mukherjee, Sayan, et al.
Publicado: (2016) -
Boolean representations of simplicial complexes and matroids
por: Rhodes, John, et al.
Publicado: (2015) -
In Simplici Salus
Publicado: (1891)