Personalized First Issue Recommender for Newcomers in Open Source Projects

• URL: http://arxiv.org/abs/2308.09038v2
• Date: Sat, 26 Aug 2023 11:54:55 GMT
• Title: Personalized First Issue Recommender for Newcomers in Open Source Projects
• Abstract summary: We analyze 37 newcomers and their first issues resolved across multiple projects. We find that the first issues resolved by the same newcomer share similarities in task type, programming language, and project domain. We propose a Personalized First Issue Recommender (PFIRec) to rank candidate issues for a given newcomer by leveraging the identified influential features.
• Score: 12.444293953494032
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many open source projects provide good first issues (GFIs) to attract and retain newcomers. Although several automated GFI recommenders have been proposed, existing recommenders are limited to recommending generic GFIs without considering differences between individual newcomers. However, we observe mismatches between generic GFIs and the diverse background of newcomers, resulting in failed attempts, discouraged onboarding, and delayed issue resolution. To address this problem, we assume that personalized first issues (PFIs) for newcomers could help reduce the mismatches. To justify the assumption, we empirically analyze 37 newcomers and their first issues resolved across multiple projects. We find that the first issues resolved by the same newcomer share similarities in task type, programming language, and project domain. These findings underscore the need for a PFI recommender to improve over state-of-the-art approaches. For that purpose, we identify features that influence newcomers' personalized selection of first issues by analyzing the relationship between possible features of the newcomers and the characteristics of the newcomers' chosen first issues. We find that the expertise preference, OSS experience, activeness, and sentiment of newcomers drive their personalized choice of the first issues. Based on these findings, we propose a Personalized First Issue Recommender (PFIRec), which employs LamdaMART to rank candidate issues for a given newcomer by leveraging the identified influential features. We evaluate PFIRec using a dataset of 68,858 issues from 100 GitHub projects. The evaluation results show that PFIRec outperforms existing first issue recommenders, potentially doubling the probability that the top recommended issue is suitable for a specific newcomer and reducing one-third of a newcomer's unsuccessful attempts to identify suitable first issues, in the median.

Related papers

• A Longitudinal Analysis of Good First Issue Practices and Newcomer Pull Requests in Popular OSS Projects [2.385829414517223]
  Open-source software projects widely adopt "good first issue" (GFI) labels to highlight beginner-friendly tasks.<n>This study analyzes 406,826 issues and 1,117 newcomer GFI pull requests across 37 popular GitHub repositories over a four-year period.<n>We find that while the proportion of issues with GFI labels remained stable during the first three years, it underwent a statistically significant decline beginning in January 2024.
  arXiv  Detail & Related papers  (2026-04-30T07:36:57Z)
• Fairness for niche users and providers: algorithmic choice and profile portability [0.7711381100220001]
  We study the impact of algorithmic pluralism on the recommendation ecosystem.<n>Prior work has shown that niche consumers and (especially) niche providers benefit from algorithmic choice.<n>We explore how different policies regarding the handling of user profiles interact with fairness outcomes for consumers and providers.
  arXiv  Detail & Related papers  (2025-08-28T07:38:59Z)
• FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation [28.8047308546416]
  We introduce the federated collaborative information aggregation (FedCIA) method for privacy-preserving recommendation. FedCIA allows clients to align their local models without constraining embeddings to a unified vector space. It mitigates information loss caused by direct summation, preserves the personalized embedding distributions of individual clients, and supports the aggregation of parameter-free models.
  arXiv  Detail & Related papers  (2025-04-19T06:59:34Z)
• Learning Recommender Systems with Soft Target: A Decoupled Perspective [49.83787742587449]
  We propose a novel decoupled soft label optimization framework to consider the objectives as two aspects by leveraging soft labels. We present a sensible soft-label generation algorithm that models a label propagation algorithm to explore users' latent interests in unobserved feedback via neighbors.
  arXiv  Detail & Related papers  (2024-10-09T04:20:15Z)
• Personalized Federated Collaborative Filtering: A Variational AutoEncoder Approach [49.63614966954833]
  Federated Collaborative Filtering (FedCF) is an emerging field focused on developing a new recommendation framework with preserving privacy. Existing FedCF methods typically combine distributed Collaborative Filtering (CF) algorithms with privacy-preserving mechanisms, and then preserve personalized information into a user embedding vector. This paper proposes a novel personalized FedCF method by preserving users' personalized information into a latent variable and a neural model simultaneously.
  arXiv  Detail & Related papers  (2024-08-16T05:49:14Z)
• From First Patch to Long-Term Contributor: Evaluating Onboarding Recommendations for OSS Newcomers [3.673153666095999]
  There are two key research gaps regarding recommendations for newcomers to open-source software (OSS) projects. First, most of the existing recommendations are based on a limited number of projects, which raises concerns about their generalizability. Second, it's unclear whether these recommendations also apply to experienced contributors.
  arXiv  Detail & Related papers  (2024-07-04T21:25:19Z)
• How to Diversify any Personalized Recommender? [0.0]
  We introduce a novel approach to improve the diversity of Top-N recommendations while maintaining accuracy. Our approach employs a user-centric pre-processing strategy aimed at exposing users to a wide array of content categories and topics. Using pre-processed data for training leads to recommender systems achieving performance levels comparable to, and in some cases, better than those trained on original, unmodified data.
  arXiv  Detail & Related papers  (2024-05-03T15:02:55Z)
• FedRec+: Enhancing Privacy and Addressing Heterogeneity in Federated Recommendation Systems [15.463595798992621]
  FedRec+ is an ensemble framework for federated recommendation systems. It enhances privacy and reduces communication costs for edge users. Experimental results demonstrate the state-of-the-art performance of FedRec+.
  arXiv  Detail & Related papers  (2023-10-31T05:36:53Z)
• AdAM: Few-Shot Image Generation via Adaptation-Aware Kernel Modulation [71.58154388819887]
  Few-shot image generation (F SIG) aims to generate new and diverse images given few (e.g., 10) training samples. Recent work has addressed F SIG by leveraging a GAN pre-trained on a large-scale source domain and adapting it to the target domain with few target samples. We propose Adaptation-Aware kernel Modulation (AdAM) for general F SIG of different source-target domain proximity.
  arXiv  Detail & Related papers  (2023-07-04T03:56:43Z)
• Source-Free Domain Adaptation for SSVEP-based Brain-Computer Interfaces [1.4364491422470593]
  This paper presents a source free domain adaptation method for steady-state visually evoked potentials (SSVEP) based brain-computer interface (BCI) spellers. achieving a high information transfer rate (ITR) in most prominent methods requires an extensive calibration period before using the system. We propose a novel method that adapts a powerful deep neural network (DNN) pre-trained on data from source domains to the new user.
  arXiv  Detail & Related papers  (2023-05-27T08:02:46Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• Prior Knowledge Guided Unsupervised Domain Adaptation [82.9977759320565]
  We propose a Knowledge-guided Unsupervised Domain Adaptation (KUDA) setting where prior knowledge about the target class distribution is available. In particular, we consider two specific types of prior knowledge about the class distribution in the target domain: Unary Bound and Binary Relationship. We propose a rectification module that uses such prior knowledge to refine model generated pseudo labels.
  arXiv  Detail & Related papers  (2022-07-18T18:41:36Z)
• Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations [92.47380209981348]
  We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning. We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions. These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
  arXiv  Detail & Related papers  (2022-04-01T10:10:50Z)
• Parameterless Gene-pool Optimal Mixing Evolutionary Algorithms [0.0]
  We present the latest version of, and propose substantial enhancements to, the Gene-pool Optimal Mixing Evoutionary Algorithm (GOMEA) We show that GOMEA and CGOMEA significantly outperform the original GOMEA and DSMGA-II on most problems.
  arXiv  Detail & Related papers  (2021-09-11T11:35:14Z)
• Unsupervised and self-adaptative techniques for cross-domain person re-identification [82.54691433502335]
  Person Re-Identification (ReID) across non-overlapping cameras is a challenging task. Unsupervised Domain Adaptation (UDA) is a promising alternative, as it performs feature-learning adaptation from a model trained on a source to a target domain without identity-label annotation. In this paper, we propose a novel UDA-based ReID method that takes advantage of triplets of samples created by a new offline strategy.
  arXiv  Detail & Related papers  (2021-03-21T23:58:39Z)
• Random Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks [4.007832851105161]
  We develop a novel recommendation framework with a goal of improving information diversity using a modified random walk exploration of the user-item graph. For recommending political content on social networks, we first propose a new model to estimate the ideological positions for both users and the content they share. Based on these estimated positions, we generate diversified personalized recommendations using our new random-walk based recommendation algorithm.
  arXiv  Detail & Related papers  (2021-02-18T21:53:32Z)

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.