Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

User Community DiscoveryCommunity Discovery: Simple and Scalable Approaches

User Community Discovery: Community Discovery: Simple and Scalable Approaches [The increasing size and complexity of online social networks have brought distinct challenges to the task of community discovery. A community discovery algorithm needs to be efficient, not taking a prohibitive amount of time to finish. The algorithm should also be scalable, capable of handling large networks containing billions of edges or even more. Furthermore, a community discovery algorithm should be effective in that it produces community assignments of high quality. In this chapter, we present a selection of algorithms that follow simple design principles, and have proven highly effective and efficient according to extensive empirical evaluations. We start by discussing a generic approach of community discovery by combining multilevel graph contraction with core clustering algorithms. Next we describe the usage of network sampling in community discovery, where the goal is to reduce the number of nodes and/or edges while retaining the network’s underlying community structure. Finally, we review research efforts that leverage various parallel and distributed computing paradigms in community discovery, which can facilitate finding communities in tera- and peta-scale networks.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

User Community DiscoveryCommunity Discovery: Simple and Scalable Approaches

Part of the Human–Computer Interaction Series Book Series
Editors: Paliouras, Georgios; Papadopoulos, Symeon; Vogiatzis, Dimitrios; Kompatsiaris, Yiannis
Ruan, Yiye; Fuhry, David; Liang, Jiongqian; Wang, Yu; Parthasarathy, Srinivasan
User Community Discovery — Oct 29, 2015
Download PDF
31 pages

Loading next page...
 
/lp/springer-journals/user-community-discovery-community-discovery-simple-and-scalable-XjgIoZSR0D
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2015
ISBN
978-3-319-23834-0
Pages
23 –54
DOI
10.1007/978-3-319-23835-7_2
Publisher site
See Chapter on Publisher Site

Abstract

[The increasing size and complexity of online social networks have brought distinct challenges to the task of community discovery. A community discovery algorithm needs to be efficient, not taking a prohibitive amount of time to finish. The algorithm should also be scalable, capable of handling large networks containing billions of edges or even more. Furthermore, a community discovery algorithm should be effective in that it produces community assignments of high quality. In this chapter, we present a selection of algorithms that follow simple design principles, and have proven highly effective and efficient according to extensive empirical evaluations. We start by discussing a generic approach of community discovery by combining multilevel graph contraction with core clustering algorithms. Next we describe the usage of network sampling in community discovery, where the goal is to reduce the number of nodes and/or edges while retaining the network’s underlying community structure. Finally, we review research efforts that leverage various parallel and distributed computing paradigms in community discovery, which can facilitate finding communities in tera- and peta-scale networks.]

Published: Oct 29, 2015

Keywords: Spectral Cluster; Community Detection; Original Graph; Community Detection Algorithm; Community Discovery

There are no references for this article.