Improving Change Recommendation using Aggregated Association Rules
T. Rolfsnes, L. Moonen, S. Di Alesio, R. Behjati and D. Binkley. Improving Change Recommendation using Aggregated Association Rules. In International Conference on Mining Software Repositories (MSR). ACM, 2016.
Abstract
Past research has proposed association rule mining as a means to uncover the evolutionary coupling from a system’s change history. These couplings have various applications, such as improving system decomposition and recommending related changes during development. The strength of the coupling can be characterized using a variety of interestingness measures. Existing recommendation engines typically use only the rule with the highest interestingness value in situations where more than one rule applies. In contrast, we argue that multiple applicable rules indicate increased evidence, and hypothesize that the aggregation of such rules can be exploited to provide more accurate recommendations. To investigate this hypothesis we conduct an empirical study on the change histories of two large industrial systems and four large open source systems. As aggregators we adopt three cumulative gain functions from information retrieval. The experiments evaluate the three using forty different rule interestingness measures. The results show that aggregation provides a significant impact on most measure’s value and, furthermore, leads to a significant improvement in the resulting recommendation.
Keywords
change impact analysis, change recommendations, evolutionary coupling, interestingness aggregator, rule aggregation, targeted association rule mining
Bibtex
@inProceedings{
title = {Improving change recommendation using aggregated association rules},
year = {2016},
pages = {73-84},
websites = {http://dl.acm.org/citation.cfm?doid=2901739.2901756},
publisher = {ACM},
author = {Rolfsnes, Thomas and Moonen, Leon and Di Alesio, Stefano and Behjati, Razieh and Binkley, Dave},
booktitle = {International Conference on Mining Software Repositories (MSR)}
}