Subgraph nomination: query by example subgraph retrieval in networks

DOI10.1007/s11222-023-10206-6zbMath1516.62002arXiv2101.12430OpenAlexW3127463074MaRDI QIDQ6171795

Vince Lyzinski, Carey E. Priebe, Al-Fahad Al-Qadhi, Hayden S. Helm

Publication date: 18 July 2023

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.12430

zbMATH Keywords

information retrievalstatistical machine learningsocial and information networks

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• Unnamed Item
• Unnamed Item
• A nonparametric two-sample hypothesis testing problem for random graphs
• Vertex nomination schemes for membership prediction
• MCLUST: Software for model-based cluster analysis
• Vertex nomination, consistent estimation, and adversarial modification
• Vertex nomination: the canonical sampling and the extended spectral nomination schemes
• Learning to Rank for Information Retrieval
• An Algorithm for Subgraph Isomorphism
• Color-coding
• Vertex nomination via seeded graph matching
• Fast unfolding of communities in large networks
• Hierarchical Community Detection by Recursive Partitioning

This page was built for publication: Subgraph nomination: query by example subgraph retrieval in networks