Accès ouvert · CC BY

Bug Fix Time Optimization Using K-medoids Clustering Technique

Article scientifique 2023 Informatique et sciences numériques › Génie logiciel (OCDE 1.2) Anglais

Résumé

Abstract In software engineering practice, bug triaging, assigning a developer for a bug report to fix it, consumes time besides being error-prone process. Most of previously proposed automation approaches focus on classification techniques. However, the developer workload and developer availability are taken into account in only a handful number papers. In this work, a new automated triaging approach is proposed, which automates the triaging process and optimizes the total fixing time, considering the developer workload, developer availability and the developer previous experience. The proposed solution leverages text mining and clustering technique (K-medoids algorithm). Linux, Eclipse and Apache repositories are explored for evaluating the proposed algorithm. Experimental results showed that the proposed algorithm (1) reduces the total fixing time by 58.16%, 22.84%, and 23.17% in Linux, Eclipse and Apache respectively, (2) normalizes the developer workload and (3) considers the developer availability in assignment decisions.

Citer ce document

Fanoos, M., Hamdy, A., & Nagaty, K. (2023). Bug Fix Time Optimization Using K-medoids Clustering Technique. Research Square. https://doi.org/10.21203/rs.3.rs-2620210/v1

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 16/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 26

Téléchargements (hors robots) : 0

Méthode de comptage