Models of performance of time series forecasters

Neurocomputing

Volumn 122, Issue , 2013, Pages 375-385

  Graff, Mario ^a   Escalante, Hugo Jair ^b   Cerda Jacobo, Jaime ^a   Avalos Gonzalez, Alberto ^a  

^a UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

^b INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

Author keywords

Algorithm selection problem; Forecasting; Performance prediction; Time series; Time series features

Indexed keywords

ACCURATE PREDICTION; ALGORITHM SELECTION; AUTOMATIC PROCEDURES; CLASSIFICATION TASKS; LINEAR COMBINATIONS; PERFORMANCE PREDICTION; TIME SERIES FEATURES; TIME SERIES FORECASTING;

ALGORITHMS; FEATURE EXTRACTION; FORECASTING; TIME SERIES;

PROBLEM SOLVING;

ACCURACY; ARTICLE; AUTOMATION; CLASSIFICATION; EVOLUTIONARY ALGORITHM; FORECASTING; INFORMATION PROCESSING; MACHINE LEARNING; MATHEMATICAL ANALYSIS; PREDICTION; PRIORITY JOURNAL; PROBLEM SOLVING; TIME SERIES ANALYSIS;

EID: 84884201967     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2013.05.035     Document Type: Article

References (49)

1. Adya M., Armstrong J., Collopy F., Kennedy M. An application of rule-based forecasting to a situation lacking domain knowledge. Int. J. Forecast. 2000, 16(October (4)):477-484.
2. Adya M., Collopy F., Armstrong J., Kennedy M. Automatic identification of time series features for rule-based forecasting. Int. J. Forecast. 2001, 17(April (2)):143-157.
3. Akaike H. A new look at the statistical model identification. IEEE Trans. Autom. Control 1974, 19(December (6)):716-723.
4. Alpaydin E. Introduction to Machine Learning 2004, MIT Press, Cambridge, MA, USA.
5. Arinze B. Selecting appropriate forecasting models using rule induction. Omega 1994, 22(November (6)):647-658.
6. Arinze B., Kim S.-L., Anandarajan M. Combining and selecting forecasting models using rule based induction. Comput. Oper. Res. 1997, 24(May (5)):423-433.
7. G.E.P. Box, D.R. Cox, An analysis of transformations, J. R. Stat. Soc. Ser. B (Methodol.) (1964) 211-252.
8. Brown R.G. Statistical Forecasting for Inventory Control 1959, McGraw-Hill.
9. Collopy F., Armstrong J.S. Rule-based forecasting. development and validation of an expert systems approach to combining time series extrapolations. Manage. Sci. 1992, 38(October (10)):1394-1414.
10. De Livera A.M., Hyndman R.J., Snyder R.D. Forecasting time series with complex seasonal patterns using exponential smoothing. J. Am. Stat. Assoc. 2011, 106(December (496)):1513-1527.
11. Duda R., Hart P.E., Stork D.G. Pattern Classification 2000, Wiley.
12. Durbin J., Koopman S.J., Atkinson A.C. Time Series Analysis by State Space Methods, vol. 15 2001, Oxford University Press, Oxford.
13. Efron B. Least angle regression. Ann. Stat. 2004, 32(2):407-499.
14. Escalante H.J., Montes M., Sucar L.E. Particle swarm model selection. J. Mach. Learn. Res. 2009, 10(June):405-440.
15. M. Graff, R. Poli, J.J. Flores, Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty, Evol. Comput. (November) (2012) http://dx.doi.org/10.1162/EVCO_a_00096, in press.
16. Holt C.C., Modigliani F., Muth J.F., Simon H.A., Bonini C.P., Winters P.R. Planning Production, Inventories, and Work Force 1960, Prentice Hall.
17. F. Hutter, Y. Hamadi, H.H. Hoos, K. Leyton-Brown, Performance prediction and automated tuning of randomized and parametric algorithms, in: CP, 2006, pp. 213-228.
18. Hyndman R., Akram M., Archibald B. The admissible parameter space for exponential smoothing models. Ann. Inst. Stat. Math. 2008, 60(2):407-426.
19. R. Hyndman, A.B. Koehler, J.K. Ord, R.D. Snyder, Forecasting with Exponential Smoothing: The State Space Approach, Springer, August 2008.
20. Hyndman R.J., Khandakar Y. Automatic time series forecasting. the forecast package for R. J. Stat. Software 2008, 27(3):1-22.
21. Hyndman R.J., Koehler A.B., Snyder R.D., Grose S. A state space framework for automatic forecasting using exponential smoothing methods. Int. J. Forecast. 2002, 18(July (3)):439-454.
22. Koza J.R. Genetic Programming. On the Programming of Computers by Means of Natural Selection (Complex Adaptive Systems) 1992, The MIT Press.
23. Kruskal W.H., Wallis W.A. Use of ranks in one-criterion variance analysis. J. Am. Stat. Assoc. 1952, 47(December (260)):583.
24. Lemke C., Gabrys B. Meta-learning for time series forecasting and forecast combination. Neurocomputing 2010, 73(June (10-12)):2006-2016.
25. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, Y. Shoham, Boosting as a metaphor for algorithm design, in: CP, 2003, pp. 899-903.
26. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, Y. Shoham, A portfolio approach to algorithm selection, in: IJCAI, 2003, pp. 1542.
27. K. Leyton-Brown, E. Nudelman, Y. Shoham, Learning the empirical hardness of optimization problems: the case of combinatorial auctions, in: CP, 2002, pp. 556-572.
28. Leyton-Brown K., Nudelman E., Shoham Y. Empirical hardness models for combinatorial auctions. Combinatorial Auctions 2006, 479-504. MIT Press, (Chapter 19). P. Cramton, Y. Shoham, R. Steinberg (Eds.).
29. Leyton-Brown K., Nudelman E., Shoham Y. Empirical hardness models. methodology and a case study on combinatorial auctions. J. ACM 2009, 56(4):1-52.
30. Mahajan V., Wind Y. New product forecasting models. directions for research and implementation. Int. J. Forecast. 1988, 4(3):341-358.
31. Makridakis S., Andersen A., Carbone R., Fildes R., Hibon M., Lewandowski R., Newton J., Parzen E., Winkler R. The accuracy of extrapolation (time series) methods. results of a forecasting competition. J. Forecast. 1982, 1(2):111-153.
32. Makridakis S., Hibon M. The m3-competition. results, conclusions and implications. Int. J. Forecast. 2000, 16(October (4)):451-476.
33. Makridakis S., Whellwright S.C., Hyndamn R.J. Forecasting Methods and Applications 1992, John Wiley & Sons, Inc. 3rd edition.
34. Graff Mario, Poli Riccardo Practical performance models of algorithms in evolutionary program induction and other domains. Artif. Intell. 2010, 174(October (15)):1254-1276.
35. Meade N. Evidence for the selection of forecasting methods. J. Forecast. 2000, 19(6):515-535.
36. E. Nudelman, K. Leyton-Brown, H.H. Hoos, A. Devkar, Y. Shoham, Understanding random SAT: beyond the clauses-to-variables ratio, in: CP, 2004, pp. 438-452.
37. R. Poli, W.B. Langdon, N.F. McPhee, A field guide to genetic programming, Published via 〈〉 and freely available at 〈〉, 2008. (With contributions by J. R. Koza). http://www.gp-field-guide.org.uk.
38. Prudencio R.B., Ludermir T.B. Meta-learning approaches to selecting time series models. Neurocomputing 2004, 61(October (0)):121-137.
39. Rice J.R. The algorithm selection problem. Adv. Comput. 1976, 15:65-118.
40. Shah C. Model selection in univariate time series forecasting using discriminant analysis. Int. J. Forecast. 1997, 13(December (4)):489-500.
41. Shanmugam R. Introduction to time series and forecasting. Technometrics 1997, 39(4). 426.
42. Smith-Miles K.A. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 2008, 41(1):1-25.
43. J.H. Stock, M.W. Watson, A comparison of linear and nonlinear univariate models for forecasting macroeconomic time series, Working Paper 6607, National Bureau of Economic Research, June 1998.
44. Wang X., Smith-Miles K., Hyndman R. Rule induction for forecasting method selection. meta-learning the characteristics of univariate time series. Neurocomputing 2009, 72(June (10-12)):2581-2594.
45. Wilcoxon F. Individual comparisons by ranking methods. Biometrics Bull. 1945, 1(December (6)):80.
46. L. Xu, H.H. Hoos, K. Leyton-Brown, Hierarchical hardness models for SAT, in: CP, 2007, pp. 696-711.
47. L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown, SATzilla-07: the design and analysis of an algorithm portfolio for SAT, in: CP, 2007, pp. 712-727.
48. Xu L., Hutter F., Hoos H.H., Leyton-Brown K. SATzilla. portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 2008, 32(June):565-606.
49. Xu P., Jayawardena A., Li W. Model selection for RBF network via generalized degree of freedom. Neurocomputing 2013, 99(January):163-171.