Developers Assignment for Analyzing Pull Requests

被引:22
|
作者
de Lima Junior, Manoel Limeira [1 ]
Soares, Daricelio Moreira [1 ]
Plastino, Alexandre [2 ]
Murta, Leonardo [2 ]
机构
[1] Univ Fed Acre, Rio Branco, AC, Brazil
[2] Univ Fed Fluminense, Inst Comp, Niteroi, RJ, Brazil
关键词
Pull-based development; pull request assignment; distributed software development;
D O I
10.1145/2695664.2695884
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A new collaboration approach is becoming increasingly common in open-source projects: the pull request model. In this kind of collaboration, developers that do not belong to the core team of a project can submit contributions to the core team. In projects that receive many pull requests, the task of assigning developers to analyze them is a difficult one. In this work, we propose to use data mining techniques, more specifically, classification strategies, in order to suggest the most appropriate developers to analyze a contribution, considering the pull request model. The experiments were conducted using 21 open source projects, each one characterized by 14 attributes. The first set of experiments aimed at indicating just one developer to analyze the pull request. The obtained predictive accuracy ranged from 22.45% to 68.27%. The Random Forest classifier achieved the best result in 76% on the projects. In the second set of experiments, we conclude that, when suggesting three developers to analyze a pull request, the chance of identifying the developer that actually analyzed the pull request ranged from 47.33% to 95.47%.
引用
收藏
页码:1567 / 1572
页数:6
相关论文
共 50 条
  • [41] DECOBA: Utilizing Developers Communities in Bug Assignment
    Banitaan, Shadi
    Alenezi, Mamdouh
    [J]. 2013 12TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2013), VOL 2, 2013, : 66 - 71
  • [42] Characterizing the Problem of Developers' Assignment for Merging Branches
    Costa, Catarina
    Figueiredo, J. J. C.
    Ghiotto, Gleiph
    Murta, Leonardo
    [J]. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2014, 24 (10) : 1489 - 1508
  • [43] Improving Feedback on GitHub Pull Requests: A Bots Approach
    Hu, Zhewei
    Gehringer, Edward F.
    [J]. 2019 IEEE FRONTIERS IN EDUCATION CONFERENCE (FIE 2019), 2019,
  • [44] Predicting which pull requests will get reopened in GitHub
    Mohamed, Abdillah
    Zhang, Li
    Jiang, Jing
    Ktob, Ahmed
    [J]. 2018 25TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC 2018), 2018, : 375 - 384
  • [45] Nudge: Accelerating Overdue Pull Requests toward Completion
    Maddila, Chandra
    Upadrasta, Sai Surya
    Bansal, Chetan
    Nagappan, Nachiappan
    Gousios, Georgios
    van Deursen, Arie
    [J]. ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2023, 32 (02)
  • [46] Prediction of Pull Requests Review Time in Open Source Projects
    Messias e Silva, Jonathan
    de Lima Junior, Manoel Limeira
    [J]. PROCEEDINGS OF THE 20TH BRAZILIAN SYMPOSIUM ON SOFTWARE QUALITY, SBOS 2021, 2021,
  • [47] Predicting the First Response Latency of Maintainers and Contributors in Pull Requests
    Khatoonabadi, Sayedhassan
    Abdellatif, Ahmad
    Costa, Diego Elias
    Shihab, Emad
    [J]. IEEE Transactions on Software Engineering, 2024, 50 (10) : 2529 - 2543
  • [48] MELT: Mining Effective Lightweight Transformations from Pull Requests
    Ramos, Daniel
    Mitchell, Hailie
    Lynce, Ines
    Manquinho, Vasco
    Martins, Ruben
    Le Goues, Claire
    [J]. 2023 38TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, ASE, 2023, : 1516 - 1528
  • [49] Acceptance Factors of Pull Requests in Open-Source Projects
    Soares, Daricelio Moreira
    de Lima Junior, Manoel Limeira
    Murta, Leonardo
    [J]. 30TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, VOLS I AND II, 2015, : 1541 - 1546
  • [50] Predicting the lifetime of pull requests in open-source projects
    de Lima Junior, Manoel Limeira
    Soares, Daricelio
    Plastino, Alexandre
    Murta, Leonardo
    [J]. JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS, 2021, 33 (06)