Searching for a single community in a graph
A Ray, S Sanghavi, S Shakkottai - ACM SIGMETRICS Performance …, 2016 - dl.acm.org
In standard graph clustering/community detection, one is interested in partitioning the graph
into more densely connected subsets of nodes. In contrast, the search problem of this paper
aims to only find the nodes in a single such community, the target, out of the many
communities that may exist. To do so, we are given suitable side information about the
target; for example, a very small number of nodes from the target are labeled as such. We
consider a general yet simple notion of side information: all nodes are assumed to have …
into more densely connected subsets of nodes. In contrast, the search problem of this paper
aims to only find the nodes in a single such community, the target, out of the many
communities that may exist. To do so, we are given suitable side information about the
target; for example, a very small number of nodes from the target are labeled as such. We
consider a general yet simple notion of side information: all nodes are assumed to have …
Searching for a Single Community in a Graph
A Ray, S Sanghavi, S Shakkottai - ACM Transactions on Modeling and …, 2018 - dl.acm.org
In standard graph clustering/community detection, one is interested in partitioning the graph
into more densely connected subsets of nodes. In contrast, the search problem of this article
aims to only find the nodes in a single such community, the target, out of the many
communities that may exist. To do so, we are given suitable side information about the
target; for example, a very small number of nodes from the target are labeled as such. We
consider a general yet simple notion of side information: all nodes are assumed to have …
into more densely connected subsets of nodes. In contrast, the search problem of this article
aims to only find the nodes in a single such community, the target, out of the many
communities that may exist. To do so, we are given suitable side information about the
target; for example, a very small number of nodes from the target are labeled as such. We
consider a general yet simple notion of side information: all nodes are assumed to have …
Showing the best results for this search. See all results