Local clustering via approximate heat kernel PageRank with subgraph sampling
Abstract Graph clustering, a fundamental technique in network science for understanding structures in complex systems, presents inherent problems. Though studied extensively in the literature, graph clustering in large systems remains particularly challenging because massive graphs incur a prohibiti...
Guardado en:
Autores principales: | Zhenqi Lu, Johan Wahlström, Arye Nehorai |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/55d4c7abc1664b2aad71f02ed7131d26 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow
por: Zhong-Ke Gao, et al.
Publicado: (2017) -
Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.
por: Dániel Bánky, et al.
Publicado: (2013) -
Approximate subgraph matching-based literature mining for biomedical events and relations.
por: Haibin Liu, et al.
Publicado: (2013) -
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.
por: Maarten Houbraken, et al.
Publicado: (2014) -
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
por: Sofie Demeyer, et al.
Publicado: (2013)