mlsanityData to 14 Oct 2026

Automated Recovery of Issue-Commit Links Leveraging Both Textual and Non-textual Data

arXiv 2107.01894 ↗First posted 5 Jul 2021cs.SE cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

An issue documents discussions around required changes in issue-tracking systems, while a commit contains the change itself in the version control systems. Recovering links between issues and commits can facilitate many software evolution tasks such as bug localization, and software documentation. A previous study on over half a million issues from GitHub reports only about 42.2% of issues are manually linked by developers to their pertinent commits. Automating the linking of commit-issue pairs can contribute to the improvement of the said tasks. By far, current state-of-the-art approaches for automated commit-issue linking suffer from low precision, leading to unreliable results, sometimes to the point that imposes human supervision on the predicted links. The low performance gets even more severe when there is a lack of textual information in either commits or issues. Current approaches are also proven computationally expensive. We propose Hybrid-Linker to overcome such limitations by exploiting two information channels; (1) a non-textual-based component that operates on non-textual, automatically recorded information of the commit-issue pairs to predict a link, and (2) a textual-based one which does the same using textual information of the commit-issue pairs. Then, combining the results from the two classifiers, Hybrid-Linker makes the final prediction. Thus, every time one component falls short in predicting a link, the other component fills the gap and improves the results. We evaluate Hybrid-Linker against competing approaches, namely FRLink and DeepLink on a dataset of 12 projects. Hybrid-Linker achieves 90.1%, 87.8%, and 88.9% based on recall, precision, and F-measure, respectively. It also outperforms FRLink and DeepLink by 31.3%, and 41.3%, regarding the F-measure. Moreover, Hybrid-Linker exhibits extensive improvements in terms of performance as well.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 2 of its 22 references that are in the map. First posted on arXiv 5 Jul 2021.

Builds on

2 of 22 references.

References · 2

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 202020-MAD -- 20 Years of Issues and Commits of Mozilla and Apache Developmentcited by 3

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 2.

4 papers.