You are here

Graph Based Framework for Time Series Prediction

Journal Name:

Publication Year:

Abstract (2. Language): 
Purpose: A time series comprises of a sequence of observations ordered with time. A major task of data mining with regard to time series data is predicting the future values. In time series there is a general notion that some aspect of past pattern will continue in future. Existing time series techniques fail to capture the knowledge present in databases to make good assumptions of future values. Design/Methodology/Approach: Application of graph matching technique to time series data is applied in the paper. Findings: The study found that use of graph matching techniques on time-series data can be a useful technique for finding hidden patterns in time series database. Research Implications: The study motivates to map time series data and graphs and use existing graph mining techniques to discover patterns from time series data and use the derived patterns for making predictions. Originality/Value: The study maps the time-series data as graphs and use graph mining techniques to discover knowledge from time series data.
74-83

REFERENCES

References: 

Balestra, P., & Nerlove, M. (1966). Pooling cross section and time series data in the estimation of a dynamic model: The demand for natural gas. Econometrica, 34(3), 585-612.
Bollerslev, T. (1987). A conditionally heteroskedastic time series model for speculative prices and rates of return. The review of economics and statistics, 69(3), 542-547.
Box, G. E. P., Jenkins, G. M., & Reinsel, G. C. (1970). Time series analysis. Oakland, CA: Holden-Day.
Box, G. E. P., Jenkins, G. M., & Reinsel, G. C. (1976). Time series analysis: forecasting and control (Vol. 16): San Francisco, CA: Holden-Day.
Box, G. E. P., & Pierce, D. A. (1970). Distribution of residual autocorrelations in autoregressive-integrated moving average time series models. Journal of the American Statistical Association, 65(332), 1509-1526.
Brown, R. G. (2004). Smoothing, forecasting and prediction of discrete time series. Mineola, NY: Dover Publications.
Brown, R. G., & Smoothing, F. (1962). Prediction of Discrete Time Series. Englewood Cliffs, NJ: Prentice Hall.
Bunke, H., & Riesen, K. (2008). Graph Classification Based on Dissimilarity Space Embedding. In N. da Vitoria Lobo, T. Kasparis, F. Roli, J. Kwok, M. Georgiopoulos, G. Anagnostopoulos & M. Loog (Eds.), Structural, Syntactic, and Statistical Pattern Recognition (Vol. 5342, pp. 996-1007): Berlin / Heidelberg: Springer
Clifton, C. (2011). Data Mining. In Encyclopaedia Britannica. Retrieved from http://www.britannica.com/EBchecked/topic/1056150/data-mining
Cormen, T. H. (2001). Introduction to algorithms. Cambridge, Mass: The MIT press.
Hamilton, J. D. (1989). A new approach to the economic analysis of nonstationary time series and the business cycle. Econometrica, 57(2), 357-384.
Han, J., & Kamber, M. (2006). Data mining: concepts and techniques: Morgan Kaufmann.Johnson, R. A., & Wichern, D. W. (2002). Applied multivariate statistical analysis (Vol. 5): NJ: Prentice Hall Upper Saddle River.
Madsen, H. (2008). Time series analysis. Boca Raton: Chapman and Hall/CRC Press.
Shumway, R. H., & Stoffer, D. S. (1982). An approach to time series smoothing and forecasting using the EM algorithm. Journal of time series analysis, 3(4), 253-264.
Zhang, G. P. (2003). Time series forecasting using a hybrid ARIMA and neural network model. Neurocomputing, 50, 159-175. doi: 10.1016/s0925-2312(01)00702-0

Thank you for copying data from http://www.arastirmax.com