Generalized association rules mining with multi-branches• full-paths and its application to traffic volume prediction

Huiyu Zhou*, Shingo Mabu, Manoj Kanta Mainali, Xianneng Li, Kaoru Shimada, Kotaro Hirasawa

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Time Related Association rule mining is a kind of sequence pattern mining for sequential databases. In this paper, a Generalized Class Association Rule Mining is proposed using Genetic Network Programming (GNP) in order to find time related sequential rules more efficiently. GNP has been applied to generate the candidates of the time related association rules as a tool. For fully utilizing the potential ability of GNP structure, the mechanism of Generalized GNP with Multi-Branches• Full-Paths mechanism is proposed for class association data mining. The aim of this algorithm is to better handle association rule extraction from the databases with high efficiency in a variety of time-related applications, especially in the traffic volume prediction problems. The algorithm capable of finding the important time related association rules is described and experimental results are presented using a traffic prediction problem.

Original languageEnglish
Title of host publicationICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings
Pages147-152
Number of pages6
Publication statusPublished - 2009
EventICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009 - Fukuoka
Duration: 2009 Aug 182009 Aug 21

Other

OtherICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009
CityFukuoka
Period09/8/1809/8/21

ASJC Scopus subject areas

  • Information Systems
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Generalized association rules mining with multi-branches• full-paths and its application to traffic volume prediction'. Together they form a unique fingerprint.

Cite this