mlsanityData to 7 Oct 2026

Subgraph nomination: Query by Example Subgraph Retrieval in Networks

arXiv 2101.12430 ↗First posted 29 Jan 2021cs.LG cs.IR cs.SIcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper introduces the subgraph nomination inference task, in which example subgraphs of interest are used to query a network for similarly interesting subgraphs. This type of problem appears time and again in real world problems connected to, for example, user recommendation systems and structural retrieval tasks in social and biological/connectomic networks. We formally define the subgraph nomination framework with an emphasis on the notion of a user-in-the-loop in the subgraph nomination pipeline. In this setting, a user can provide additional post-nomination light supervision that can be incorporated into the retrieval task. After introducing and formalizing the retrieval task, we examine the nuanced effect that user-supervision can have on performance, both analytically and across real and simulated data examples.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 54 references that are in the map. First posted on arXiv 29 Jan 2021.

Builds on

15 of 54 references.

References · 15

  1. 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
  2. 2020The Pushshift Reddit Datasetcited by 289
  3. 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 202
  4. 2018SimGNN: A Neural Network Approach to Fast Graph Similarity Computationcited by 89
  5. 2013Hierarchical Block Structures and High-resolution Model Selection in Large Networkscited by 37
  6. 2015Community Detection and Classification in Hierarchical Stochastic Blockmodelscited by 23
  7. 2016Foundations of Modern Query Languages for Graph Databasescited by 22
  8. 2018Hierarchical community detection by recursive partitioningcited by 16
  9. 2013Vertex nomination schemes for membership predictioncited by 8
  10. 2019Vertex Nomination, Consistent Estimation, and Adversarial Modificationcited by 7
  11. 2018Vertex nomination: The canonical sampling and the extended spectral nomination schemescited by 6
  12. 2018Matched Filters for Noisy Induced Subgraph Detectioncited by 6
3 more
  1. 2017Vertex Nomination Via Seeded Graph Matchingcited by 5
  2. 2017On consistent vertex nomination schemescited by 4
  3. 2016On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matchingcited by 3

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.

  1. 2023Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embeddingcited by 1