Algorithms of Data Mining and Knowledge Discovery of Correlativity in Two-Dimensional Time Series

Oriented at dynamic data from complicated process with noise disturbance, it is very difficult to discover knowledge of correlativity and orderliness. Following some analyzing results about the shortcoming of relative coefficients in mining non-stationary time series, a series of new algorithms are built in this paper to mine correlativity in two-dimensional time series. These new algorithms are based on a expansible framework of model set. Based on these new mining algorithms, a making decision table is listed not only to mine correlativity in two-dimensional time series, but also to discover deepening knowledge to transform the qualitative knowledge “nonlinear relativity” as well as “non-relativity” into deeper quantitative knowledge about analytical model. These new approaches given in this paper is exoteric in framework and can be enriched with additional new models. In this way, some professional data mining and knowledge discovery cab be fulfilled to aim at some specific professional fields.