Community Formation and Detection on GitHub Collaboration Networks

• URL: http://arxiv.org/abs/2109.11587v1
• Date: Thu, 23 Sep 2021 18:43:00 GMT
• Title: Community Formation and Detection on GitHub Collaboration Networks
• Authors: Behnaz Moradi-Jamei, Brandon L. Kramer, J. Bayoan Santiago Calderon, Gizem Korkmaz
• Abstract summary: This paper draws on a large-scale historical dataset of 1.8 million GitHub users and their repository contributions. OSS collaborations are characterized by small groups of users that work closely together.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper studies community formation in OSS collaboration networks. While most current work examines the emergence of small-scale OSS projects, our approach draws on a large-scale historical dataset of 1.8 million GitHub users and their repository contributions. OSS collaborations are characterized by small groups of users that work closely together, leading to the presence of communities defined by short cycles in the underlying network structure. To understand the impact of this phenomenon, we apply a pre-processing step that accounts for the cyclic network structure by using Renewal-Nonbacktracking Random Walks (RNBRW) and the strength of pairwise collaborations before implementing the Louvain method to identify communities within the network. Equipping Louvain with RNBRW and the contribution strength provides a more assertive approach for detecting small-scale teams and reveals nontrivial differences in community detection such as users tendencies toward preferential attachment to more established collaboration communities. Using this method, we also identify key factors that affect community formation, including the effect of users location and primary programming language, which was determined using a comparative method of contribution activities. Overall, this paper offers several promising methodological insights for both open-source software experts and network scholars interested in studying team formation.

Related papers

• Enhancing Community Detection in Networks: A Comparative Analysis of Local Metrics and Hierarchical Algorithms [49.1574468325115]
  This study employs the same method to evaluate the relevance of using local similarity metrics for community detection. The efficacy of these metrics was evaluated by applying the base algorithm to several real networks with varying community sizes.
  arXiv  Detail & Related papers  (2024-08-17T02:17:09Z)
• Locating Community Smells in Software Development Processes Using Higher-Order Network Centralities [38.72139150402261]
  Community smells are negative patterns in software development teams' interactions that impede their ability to create software. Current approaches aim to detect community smells by analysing static network representations of software teams' interaction structures. We show that higher-order network models provide a robust means of revealing such hidden patterns and complex relationships.
  arXiv  Detail & Related papers  (2023-09-14T06:48:15Z)
• A Unified Framework for Exploratory Learning-Aided Community Detection Under Topological Uncertainty [16.280950663982107]
  META-CODE is a unified framework for detecting overlapping communities in social networks. It consists of three steps: 1) node-level community-affiliation embeddings based on graph neural networks (GNNs) trained by our new reconstruction loss, 2) network exploration via community-affiliation-based node queries, and 3) network inference using an edge connectivity-based Siamese neural network model from the explored network.
  arXiv  Detail & Related papers  (2023-04-10T10:22:21Z)
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy [86.61829236732744]
  This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity. The goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes.
  arXiv  Detail & Related papers  (2023-02-28T19:17:03Z)
• META-CODE: Community Detection via Exploratory Learning in Topologically Unknown Networks [5.299515147443958]
  META-CODE is an end-to-end solution for detecting overlapping communities in networks with unknown topology. It consists of three steps: 1) initial network inference, 2) node-level community-affiliation embedding based on graph neural networks (GNNs) trained by our new reconstruction loss, and 3) network exploration via community-affiliation-based node queries.
  arXiv  Detail & Related papers  (2022-08-23T15:02:48Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• A multilevel clustering technique for community detection [0.0]
  This study presents a novel detection method based on a scalable framework to identify related communities in a network. We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms. The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
  arXiv  Detail & Related papers  (2021-01-16T23:26:44Z)
• A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning [95.27249880156256]
  We develop and present a unified architecture of network community-finding methods. We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning. We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
  arXiv  Detail & Related papers  (2021-01-03T02:32:45Z)
• A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning [54.55119659523629]
  Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control. Common-pool resources include arable land, fresh water, wetlands, wildlife, fish stock, forests and the atmosphere.
  arXiv  Detail & Related papers  (2020-10-15T14:12:26Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Community detection and Social Network analysis based on the Italian wars of the 15th century [0.0]
  We study social network modelling by using human interaction as a basis. We propose a new set of functions, affinities, designed to capture the nature of the local interactions among each pair of actors in a network. We develop a new community detection algorithm, the Borgia Clustering, where communities naturally arise from the multi-agent interaction in the network.
  arXiv  Detail & Related papers  (2020-07-06T11:05:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.