Parameterizing and Assembling IR-Based Solutions for SE Tasks Using Genetic Algorithms
Abstract
Information Retrieval (IR) approaches are nowadays used to support various software engineering tasks, such as feature location, traceability link recovery, clone detection, or refactoring. However, previous studies showed that inadequate instantiation of an IR technique and underlying process could significantly affect the performance of such approaches in terms of precision and recall. This paper proposes the use of Genetic Algorithms (GAs) to automatically configure and assemble an IR process for software engineering tasks. The approach (named GA-IR) determines the (near) optimal solution to be used for each stage of the IR process, i.e., term extraction, stop word removal, stemming, indexing and an IR algebraic method calibration. We applied GA-IR on two different software engineering tasks, namely traceability link recovery and identification of duplicate bug reports. The results of the study indicate that GA-IR outperforms approaches previously published in the literature, and that it does not significantly differ from an ideal upper bound that could be achieved by a supervised and combinatorial approach.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The performance of machine learning based software engineering approaches varies depending on the underlying datasets.
“While there are many successful and widely adopted ML-based approaches that use different code representations to support SE tasks, their performance varies depending on the underlying datasets [56,57].”
From Deep learning similarities from different representations of source code (2018) · cites this paper as [56]
HOPE preserves asymmetric transitivity by implementing the Katz proximity metric.
“HOPE preserves asymmetric transitivity by implementing the highly correlated metric known as the Katz proximity.”
From Deep learning similarities from different representations of source code (2018) · cites this paper as [55]
HOPE embeds directed graphs, which is needed for control flow graphs.
“differently from other techniques (e.g., SDNE), HOPE embeds directed graphs (as needed in the case of Control Flow Graphs).”
From Deep learning similarities from different representations of source code (2018) · cites this paper as [55]
Cites
Can Better Identifier Splitting Techniques Help Feature Location?
Dit, B., Guerrouj, L., Poshyvanyk, D., & Antoniol, G. (2011) · 2011 IEEE 19th International Conference on Program Comprehension · doi:10.1109/icpc.2011.47 · Cited by 89 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Deep learning similarities from different representations of source code
Tufano, M., Watson, C., Bavota, G., Di Penta, M., White, M., & Poshyvanyk, D. (2018) · Proceedings of the 15th International Conference on Mining Software Repositories · doi:10.1145/3196398.3196431 · Cited by 158 · see citing works
Self-citation
- Authors
- Panichella, A., Dit, B., Oliveto, R., Di Penta, M., Poshyvanyk, D., & De Lucia, A.
- Affiliations
- Delft University of Technology (NL)
- Boise State University (US)
- University of Molise (IT)
- William & Mary (US)
- Venue
- 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)
- Publisher
- IEEE
- Published
- 2016-03
- Pages
- 314-325
- OpenAlex
- W2407167388
- Cited by
- 36
- References
- 1
- Citations by year
- 2025: 1 · 2024: 2 · 2023: 1 · 2022: 3 · 2021: 4 · 2020: 2 · 2019: 7 · 2018: 7 · 2017: 6 · 2016: 3
- FWCI
- 6.51
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) (publishedVersion)
- Scholar Works (Boise State University) (submittedVersion)
- Archivio Istituzionale della Ricerca - Università degli Studi del Molise (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Software Engineering Techniques and Practices
- Keywords
- genetic algorithm, information retrieval, software engineering tasks, automatic configuration, parameter tuning, traceability link recovery, duplicate bug report detection, term extraction, stemming, stop word removal, indexing, feature location, clone detection, refactoring
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review