TY - JOUR
T1 - Genetic network programming with estimation of distribution algorithms for class association rule mining in traffic prediction
AU - Li, Xianneng
AU - Mabu, Shingo
AU - Zhou, Huiyu
AU - Shimada, Kaoru
AU - Hirasawa, Kotaro
PY - 2010/7
Y1 - 2010/7
N2 - Genetic Network Programming (GNP) is one of the evolutionary optimization algorithms, which uses directed-graph structures to represent its solutions. It has been clarified that GNP works well to find class association rules in traffic prediction systems. In this paper, a novel evolutionary paradigm named GNP with Estimation of Distribution Algorithms (GNP-EDAs) is proposed and used to find important class association rules in traffic prediction systems. In GNP-EDAs, a probabilistic model replaces crossover and mutation to enhance the evolution. The new population of individuals is produced from the probabilistic distribution estimated from the selected elite individuals of the previous generation. The probabilistic information on the connections and transitions of GNP-EDAs is extracted from its population to construct the probabilistic model. In this paper, two methods are described to build the probabilistic model for producing the offspring. In addition, a classification mechanism is introduced to estimate the traffic prediction based on the extracted class association rules. We compared GNPEDAs with the conventional GNP and the simulation results showed that GNP-EDAs can extract the class association rules more effectively, when the number of the candidate class association rules increase. And the classification accuracy of the proposed method shows good results in traffic prediction systems.
AB - Genetic Network Programming (GNP) is one of the evolutionary optimization algorithms, which uses directed-graph structures to represent its solutions. It has been clarified that GNP works well to find class association rules in traffic prediction systems. In this paper, a novel evolutionary paradigm named GNP with Estimation of Distribution Algorithms (GNP-EDAs) is proposed and used to find important class association rules in traffic prediction systems. In GNP-EDAs, a probabilistic model replaces crossover and mutation to enhance the evolution. The new population of individuals is produced from the probabilistic distribution estimated from the selected elite individuals of the previous generation. The probabilistic information on the connections and transitions of GNP-EDAs is extracted from its population to construct the probabilistic model. In this paper, two methods are described to build the probabilistic model for producing the offspring. In addition, a classification mechanism is introduced to estimate the traffic prediction based on the extracted class association rules. We compared GNPEDAs with the conventional GNP and the simulation results showed that GNP-EDAs can extract the class association rules more effectively, when the number of the candidate class association rules increase. And the classification accuracy of the proposed method shows good results in traffic prediction systems.
KW - Class association rule mining
KW - Estimation of distribution algorithms
KW - Genetic network programming
KW - Traffic prediction
UR - http://www.scopus.com/inward/record.url?scp=77954811717&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954811717&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:77954811717
SN - 1343-0130
VL - 14
SP - 497
EP - 509
JO - Journal of Advanced Computational Intelligence and Intelligent Informatics
JF - Journal of Advanced Computational Intelligence and Intelligent Informatics
IS - 5
ER -