Abstract: Association rule mining is a significant research topic in the knowledge discovery area. In the last years a great number of algorithms have been proposed with the objective of solving diverse drawbacks presented in the generation of association rules. One of the main problems is to obtain interesting rules from continuous numeric attributes. In this paper, a method for mining quantitative association rules is proposed. It deals with the problem of discretizing continuous data in order to discover a manageable number of high confident association rules, which cover a high percentage of examples in the data set. The method was validated by applying it to data from software project management metrics. Key-Words: Association rules, discretization, clustering
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.