ABSTRACT
The field of data mining provides some methods highly relevant to researchers when mining software repositories. Whether one predicts bug locations, discovers hidden architectural structures and software patterns, or identifies experts of modules, data mining algorithms are usually the working horses for these studies. The goal of this tutorial is to convey some of the most relevant theoretical foundations and practical issues when using data mining algorithms.
The tutorial will first discuss the usual data mining tasks (prediction, filtering, smoothing, and elucidation of the most likely explanation or structure). Then, it will introduce a general framework for data mining paving the way to explain the functionality of some of the most used data mining algorithms. The tutorial will close with an overview over the typical evaluation methods for induced results and a number of pointers for further study. Where possible, it will use examples from software engineering.
Index Terms
- How to learn enough data mining to be dangerous in 60 minutes
Recommendations
Mining uncertain data
As an important data mining and knowledge discovery task, association rule mining searches for implicit, previously unknown, and potentially useful pieces of information—in the form of rules revealing associative relationships—that are embedded in the ...
Mining software engineering data
ICSE '10: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2Software engineering data (such as code bases, execution traces, historical code changes, mailing lists, and bug databases) contains a wealth of information about a project's status, progress, and evolution. Using well-established data mining techniques,...
Mining fuzzy specific rare itemsets for education data
Association rule mining is an important data analysis method for the discovery of associations within data. There have been many studies focused on finding fuzzy association rules from transaction databases. Unfortunately, in the real world, one may ...
Comments