Leveraging Data Mining Algorithms to Recommend Source Code Changes
Not on the map. Why?
Abstract (arXiv)
Context: Recent research has used data mining to develop techniques that can guide developers through source code changes. To the best of our knowledge, very few studies have investigated data mining techniques and--or compared their results with other algorithms or a baseline. Objectives: This paper proposes an automatic method for recommending source code changes using four data mining algorithms. We not only use these algorithms to recommend source code changes, but we also conduct an empirical evaluation. Methods: Our investigation includes seven open-source projects from which we extracted source change history at the file level. We used four widely data mining algorithms ie Apriori, FP-Growth, Eclat, and Relim to compare the algorithms in terms of performance (Precision, Recall and F-measure) and execution time. Results: Our findings provide empirical evidence that while some Frequent Pattern Mining algorithms, such as Apriori may outperform other algorithms in some cases, the results are not consistent throughout all the software projects, which is more likely due to the nature and characteristics of the studied projects, in particular their change history. Conclusion: Apriori seems appropriate for large-scale projects, whereas Eclat appears to be suitable for small-scale projects. Moreover, FP-Growth seems an efficient approach in terms of execution time.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 46 references that are in the map. First posted on arXiv 29 Apr 2023.
Builds on
3 of 46 references.
References · 3
- 2021Leveraging Unsupervised Learning to Summarize APIs Discussed in Stack Overflowcited by 9
- 2021Development of recommendation systems for software engineering: the CROSSMINER experiencecited by 4
- 2017Comparing Dataset Characteristics that Favor the Apriori, Eclat or FP-Growth Frequent Itemset Mining Algorithmscited by 1
Built on by
Not cited yet.