Community Identification Task
Jump to navigation
Jump to search
A Community Identification Task is an intermedia-scale graph pattern identification task of a community pattern within a social graph.
References
2017
- (Rombach et al., 2017) ⇒ Puck Rombach, Mason A. Porter, James H. Fowler, and Peter J. Mucha. (2017). “Core-periphery Structure in Networks (revisited).” In: SIAM Review, 59(3). doi:10.1137/17M1130046
- QUOTE: … Intermediate-scale (or 'meso-scale') structures in networks have received considerable attention, as the algorithmic detection of such structures makes it possible to discover network features that are not apparent either at the local scale of nodes and edges or at the global scale of summary statistics. Numerous types of meso-scale structures can occur in networks, but investigations of such features have focused predominantly on the identification and study of community structure. In this paper, we develop a new method to investigate the meso-scale feature known as core-periphery structure, which entails identifying densely connected core nodes and sparsely connected peripheral nodes. In contrast to communities, the nodes in a core are also reasonably well-connected to those in a network's periphery. …
2009
- (Tantipathananandh & Berger-Wolf, 2009) ⇒ Chayant Tantipathananandh, and Tanya Berger-Wolf. (2009). “Constant-factor Approximation Algorithms for Identifying Dynamic Communities.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557110
- QUOTE: We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as unusually densely knit subsets of a social network. This notion becomes more problematic if the social interactions change over time.