Generating of derivative membership functions for fuzzy association rule mining by Particle Swarm Optimization

The association Rule Mining (ARM) is a data mining task that extracts relations between items based on the item's frequency. The ARM regards items with high frequency as more interesting than items with low frequency. In quantitative datasets, each item will be grouped into a large range of values. Therefore, items with low frequencies may not be considered as interesting. Hence, the possibility of extracting potentially interesting relations between these items will decrease. Thus, this deficiency brings a challenging issue to this field. Most of the existing methods for quantitative ARM in handling this problem are based on the Sharp Boundary Discretization methods and Clustering methods. These methods group each item into intervals with crisp boundaries which do not overlap. They bring some problems as well, such as ignoring or emphasizing more on values near the boundary of intervals. To deal with the problem of quantitative ARM, the combination of S and Z fuzzy shapes, which is combined with the Particle Swarm Optimization (PSO) is proposed in this paper to generate appropriate membership functions for each item. Fuzzy logic will group items into overlapping intervals and then, the fuzzy rules will be generated from the interesting items. The performances of the proposed methods are evaluated over Bilkent datasets and then, are compared with the results of clustering method (Fuzzy C-Means) in aspect of their capability to transform data to fuzzy data and then their efficiency are evaluated based on the quality of their generated rules. The results show the efficiency of the proposed method to extract the rules with more quality.

[1]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[2]  Tzung-Pei Hong,et al.  Trade-off Between Computation Time and Number of Rules for Fuzzy Mining from Quantitative Data , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[3]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[4]  Tzung-Pei Hong,et al.  An ACS-based framework for fuzzy data mining , 2009, Expert Syst. Appl..

[5]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[6]  Dan Simon,et al.  Hinfinity estimation for fuzzy membership function optimization , 2005, Int. J. Approx. Reason..

[7]  Erhan Akin,et al.  Rough particle swarm optimization and its applications in data mining , 2008, Soft Comput..

[8]  Mehdi Nasiri,et al.  Multi-Objective Rule Mining Using Simulated Annealing Algorithm , 2010, J. Convergence Inf. Technol..

[9]  Francisco Herrera,et al.  Learning the membership function contexts for mining fuzzy association rules by using genetic algorithms , 2009, Fuzzy Sets Syst..

[10]  Tzung-Pei Hong,et al.  A GA-based Fuzzy Mining Approach to Achieve a Trade-off Between Number of Rules and Suitability of Membership Functions , 2006, Soft Comput..

[11]  Stergios Papadimitriou,et al.  The fuzzy frequent pattern Tree , 2005 .

[12]  Tzung-Pei Hong,et al.  Mining association rules from quantitative data , 1999, Intell. Data Anal..

[13]  Reda Alhajj,et al.  A clustering algorithm with genetically optimized membership functions for fuzzy association rules mining , 2003, The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03..

[14]  Afshin Salajegheh,et al.  Multi-objective Numeric Association Rules Mining via Ant Colony Optimization for Continuous Domains without Specifying Minimum Support and Minimum Confidence , 2011 .

[15]  Witold Pedrycz,et al.  A Gradient-Descent-Based Approach for Transparent Linguistic Interface Generation in Fuzzy Models , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).