Cargando…
SubRank: Subgraph Embeddings via a Subgraph Proximity Measure
Representation learning for graph data has gained a lot of attention in recent years. However, state-of-the-art research is focused mostly on node embeddings, with little effort dedicated to the closely related task of computing subgraph embeddings. Subgraph embeddings have many applications, such a...
Autores principales: | Balalau, Oana, Goyal, Sagar |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206259/ http://dx.doi.org/10.1007/978-3-030-47426-3_38 |
Ejemplares similares
-
An inductive knowledge graph embedding via combination of subgraph and type information
por: Liu, Hongbo, et al.
Publicado: (2023) -
Local clustering via approximate heat kernel PageRank with subgraph sampling
por: Lu, Zhenqi, et al.
Publicado: (2021) -
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
por: McCreesh, Ciaran, et al.
Publicado: (2020) -
A centrality measure for cycles and subgraphs II
por: Giscard, Pierre-Louis, et al.
Publicado: (2018) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014)