An empirical study of Linespots: A novel past-fault algorithm

Abstract

This paper proposes the novel past-faults fault prediction algorithm Linespots, based on the Bugspots algorithm. We analyze the predictive performance and runtime of Linespots compared to Bugspots with an empirical study using the most significant self-built dataset as of now, including high-quality samples for validation. As a novelty in fault prediction, we use Bayesian data analysis and Directed Acyclic Graphs to model the effects. We found consistent improvements in the predictive performance of Linespots over Bugspots for all seven evaluation metrics. We conclude that Linespots should be used over Bugspots in all cases where no real-time performance is necessary.

arXiv comment20 pages, 13 figures, submitted to STVR

References in corpus (2)

• Practical Bayesian model evaluation using leave-one-out cross-validation and WAIC
• How Different Are Different diff Algorithms in Git?

Cited by in corpus (4)

• Applications of statistical causal inference in software engineering
• Applying Bayesian Analysis Guidelines to Empirical Software Engineering Data: The Case of Programming Languages and Code Quality
• Towards Causal Analysis of Empirical Software Engineering Data: The Impact of Programming Languages on Coding Competitions
• Causal Reasoning in Software Quality Assurance: A Systematic Review