scholarly journals Evolutionary algorithms and fuzzy sets for discovering temporal rules

2013 ◽  
Vol 23 (4) ◽  
pp. 855-868 ◽  
Author(s):  
Stephen G. Matthews ◽  
Mario A. Gongora ◽  
Adrian A. Hopgood

Abstract A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns are augmented into a dataset to analyse the method’s ability in a controlled experiment. It is shown that the method is capable of discovering temporal patterns, and the effect of Boolean itemset support on the efficacy of discovering temporal fuzzy association rules is presented.

2015 ◽  
Vol 14 (06) ◽  
pp. 1215-1242 ◽  
Author(s):  
Chun-Hao Chen ◽  
Tzung-Pei Hong ◽  
Yeong-Chyi Lee ◽  
Vincent S. Tseng

Since transactions may contain quantitative values, many approaches have been proposed to derive membership functions for mining fuzzy association rules using genetic algorithms (GAs), a process known as genetic-fuzzy data mining. However, existing approaches assume that the number of linguistic terms is predefined. Thus, this study proposes a genetic-fuzzy mining approach for extracting an appropriate number of linguistic terms and their membership functions used in fuzzy data mining for the given items. The proposed algorithm adjusts membership functions using GAs and then uses them to fuzzify the quantitative transactions. Each individual in the population represents a possible set of membership functions for the items and is divided into two parts, control genes (CGs) and parametric genes (PGs). CGs are encoded into binary strings and used to determine whether membership functions are active. Each set of membership functions for an item is encoded as PGs with real-number schema. In addition, seven fitness functions are proposed, each of which is used to evaluate the goodness of the obtained membership functions and used as the evolutionary criteria in GA. After the GA process terminates, a better set of association rules with a suitable set of membership functions is obtained. Experiments are made to show the effectiveness of the proposed approach.


Author(s):  
Lenka Skanderova ◽  
Ivan Zelinka

In this work, we investigate the dynamics of Differential Evolution (DE) using complex networks. In this pursuit, we would like to clarify the term complex network and analyze its properties briefly. This chapter presents a novel method for analysis of the dynamics of evolutionary algorithms in the form of complex networks. We discuss the analogy between individuals in populations in an arbitrary evolutionary algorithm and vertices of a complex network as well as between edges in a complex network and communication between individuals in a population. We also discuss the dynamics of the analysis.


2015 ◽  
Vol 295 ◽  
pp. 358-378 ◽  
Author(s):  
Ana María Palacios ◽  
José Luis Palacios ◽  
Luciano Sánchez ◽  
Jesús Alcalá-Fdez

Author(s):  
CHUN-HAO CHEN ◽  
TZUNG-PEI HONG ◽  
YEONG-CHYI LEE

Data mining is most commonly used in attempts to induce association rules from transaction data. Since transactions in real-world applications usually consist of quantitative values, many fuzzy association-rule mining approaches have been proposed on single- or multiple-concept levels. However, the given membership functions may have a critical influence on the final mining results. In this paper, we propose a multiple-level genetic-fuzzy mining algorithm for mining membership functions and fuzzy association rules using multiple-concept levels. It first encodes the membership functions of each item class (category) into a chromosome according to the given taxonomy. The fitness value of each individual is then evaluated by the summation of large 1-itemsets of each item in different concept levels and the suitability of membership functions in the chromosome. After the GA process terminates, a better set of multiple-level fuzzy association rules can then be expected with a more suitable set of membership functions. Experimental results on a simulation dataset also show the effectiveness of the algorithm.


Author(s):  
Zohreh Anari ◽  
Abdolreza Hatamlou ◽  
Babak Anari

Transactions in web data are huge amounts of data, often consisting of fuzzy and quantitative values. Mining fuzzy association rules can help discover interesting relationships between web data. The quality of these rules depends on membership functions, and thus, it is essential to find the suitable number and position of membership functions. The time spent by users on each web page, which shows their level of interest in those web pages, can be considered as a trapezoidal membership function (TMF). In this paper, the optimization problem was finding the appropriate number and position of TMFs for each web page. To solve this optimization problem, a learning automata-based algorithm was proposed to optimize the number and position of TMFs (LA-ONPTMF). Experiments conducted on two real datasets confirmed that the proposed algorithm enhances the efficiency of mining fuzzy association rules by extracting the optimized TMFs.


Sign in / Sign up

Export Citation Format

Share Document