Searching For A Single Community in a Graph
TOMPECS, Volume abs/1806.07944, Issue 3, 2018.
community detection graph clustering semi-supervised side-information stochastic block model
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 info...More
Full Text (Upload PDF)
PPT (Upload PPT)