Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs

Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called “heterogeneous information networks” or HINs). Given a large graph and a query pattern with node...

Descripción completa

Detalles Bibliográficos
Autores principales: Yang, Xiaofeng, Nicholson, Patrick K., Ajwani, Deepak, Riedewald, Mirek, Gatterbauer, Wolfgang, Sala, Alessandra
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6037532/
https://www.ncbi.nlm.nih.gov/pubmed/30003197
http://dx.doi.org/10.1145/3178876.3186115

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6037532/
https://www.ncbi.nlm.nih.gov/pubmed/30003197
http://dx.doi.org/10.1145/3178876.3186115

Ejemplares similares