The problem of community detection is a challenging one because of the presence of hubs and noisy links, which tend to create highly imbalanced graph clusters. Often, these resulting clusters are not very intuitive and difficult to interpret. With the growing availability of network information, there is a significant amount of prior knowledge available about the communities in social, communication and several other networks. These community labels may be noisy and very limited, though they do help in community detection. In this paper, we explore the use of such noisy labeled information for finding high quality communities. We will present an adaptive density-based clustering which allows flexible incorporation of prior knowledge in to the community detection process. We use a random walk framework to compute the node densities and the level of supervision regulates the node densities and the quality of resulting density based clusters. Our framework is general enough to produce both overlapping and non-overlapping clusters. We empirically show that even with a tiny amount of supervision, our approach can produce superior communities compared to popular baselines.
|Original language||English (US)|
|Title of host publication||Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013|
|Editors||Joydeep Ghosh, Zoran Obradovic, Jennifer Dy, Zhi-Hua Zhou, Chandrika Kamath, Srinivasan Parthasarathy|
|Number of pages||9|
|State||Published - 2013|
|Event||SIAM International Conference on Data Mining, SDM 2013 - Austin, United States|
Duration: May 2 2013 → May 4 2013
|Name||Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013|
|Other||SIAM International Conference on Data Mining, SDM 2013|
|Period||5/2/13 → 5/4/13|
Bibliographical notePublisher Copyright:
Copyright © SIAM.