DocumentCode
1642027
Title
Generalized Time Related Sequential Association rule mining and traffic prediction
Author
Zhou, Huiyu ; Mabu, Shingo ; Shimada, Kaoru ; Hirasawa, Kotaro
Author_Institution
Grad. Sch. of Inf., Waseda Univ., Kitakyushu
fYear
2009
Firstpage
2654
Lastpage
2661
Abstract
Time related association rule mining is a kind of sequence pattern mining for sequential databases. In this paper, we introduce a method of generalized association rule mining using genetic network programming (GNP) with time series processing mechanism in order to find time related sequential rules efficiently. GNP represents solutions as directed graph structures, thus has compact structure and implicit memory function. The inherent features of GNP make it possible for GNP to work well especially in dynamic environments. GNP has been applied to generate time related candidate association rules as a tool using the database consisting of a large number of time related attributes. The aim of this algorithm is to better handle association rule extraction from the databases in a variety of time-related applications, especially in the traffic volume prediction problems. The generalized algorithm which can find the important time related association rules is described and experimental results are presented considering a traffic prediction problem.
Keywords
data mining; directed graphs; genetic algorithms; road traffic; time series; traffic engineering computing; directed graph structure; genetic network programming; road network; sequence pattern mining; sequential database; time related association rule mining; time series processing mechanism; traffic volume prediction problem; Association rules; Computational complexity; Data mining; Economic indicators; Genetic programming; Pattern analysis; Production systems; Spatial databases; Telecommunication traffic; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location
Trondheim
Print_ISBN
978-1-4244-2958-5
Electronic_ISBN
978-1-4244-2959-2
Type
conf
DOI
10.1109/CEC.2009.4983275
Filename
4983275
Link To Document