پیش بینی مبتنی بر وقایع سری: یک چارچوب یادگیری بی نظیر بر اساس برنامه نویسی ژنتیکی

In this paper, we propose an unsupervised learning framework based on Genetic Programming (GP) to predict the position of any particular target event (defined by the user) in a time-series. GP is used to automatically build a library of candidate temporal features. The proposed framework receives a training set S={(Va)|a=0⋯n}S={(Va)|a=0⋯n}, where each VaVa is a time-series vector such that ∀Va∈S,Va={(xt)|t=0⋯tmax}∀Va∈S,Va={(xt)|t=0⋯tmax} where tmaxtmax is the size of the time-series. All Va∈SVa∈S are assumed to be generated from the same environment. The proposed framework uses a divide-and-conquer strategy for the training phase. The training process of the proposed framework works as follow. The user specifies the target event that needs to be predicted (e.g., Highest value, Second Highest value, …, etc.). Then, the framework classifies the training samples into different Bins  , where Bins={(bi)|i=0⋯tmax}Bins={(bi)|i=0⋯tmax}, based on the time-slot t   of the target event in each VaVa training sample. Each bi∈Binsbi∈Bins will contain a subset of S  . For each bibi, the proposed framework further classifies its samples into statistically independent clusters. To achieve this, each bibi is treated as an independent problem where GP is used to evolve programs to extract statistical features from each bibi’s members and classify them into different clusters using the K-Means algorithm. At the end of the training process, GP is used to build an ‘event detector’ that receives an unseen time-series and predicts the time-slot where the target event is expected to occur. Empirical evidence on artificially generated data and real-world data shows that the proposed framework significantly outperforms standard Radial Basis Function Networks, standard GP system, Gaussian Process regression, Linear regression, and Polynomial Regression.