Forecasting Financial Indices: The Baltic Dry Indices

Similar documents
Application of Physics Model in prediction of the Hellas Euro election results

Feature Extraction Techniques

Block designs and statistics

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals

Mathematical Models to Determine Stable Behavior of Complex Systems

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

COS 424: Interacting with Data. Written Exercises

Non-Parametric Non-Line-of-Sight Identification 1

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

ma x = -bv x + F rod.

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Pattern Recognition and Machine Learning. Artificial Neural networks

Bayes Decision Rule and Naïve Bayes Classifier

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks

Pattern Recognition and Machine Learning. Artificial Neural networks

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre

Predicting FTSE 100 Close Price Using Hybrid Model

Kinematics and dynamics, a computational approach

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

Machine Learning Basics: Estimators, Bias and Variance

Multi-Scale/Multi-Resolution: Wavelet Transform

Kernel Methods and Support Vector Machines

A Simple Regression Problem

Phase-Space Reconstruction. Gerrit Ansmann

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China

OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

A note on the multiplication of sparse matrices

Figure 1: Equivalent electric (RC) circuit of a neurons membrane

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino

Tracking using CONDENSATION: Conditional Density Propagation

An Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

Analyzing Simulation Results

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

Understanding Machine Learning Solution Manual

REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION

Topic 5a Introduction to Curve Fitting & Linear Regression

The Transactional Nature of Quantum Information

Warning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network

Bootstrapping Dependent Data

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

OBJECTIVES INTRODUCTION

SPECTRUM sensing is a core concept of cognitive radio

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN

1 Proof of learning bounds

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

Ufuk Demirci* and Feza Kerestecioglu**

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

GREY FORECASTING AND NEURAL NETWORK MODEL OF SPORT PERFORMANCE

Spine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

In this chapter, we consider several graph-theoretic and probabilistic models

The Algorithms Optimization of Artificial Neural Network Based on Particle Swarm

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations

Recursive Algebraic Frisch Scheme: a Particle-Based Approach

Chapter 6 1-D Continuous Groups

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP

Research in Area of Longevity of Sylphon Scraies

Nonlinear Prediction for Top and Bottom Values of Time Series

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

When Short Runs Beat Long Runs

MATHEMATICAL MODEL OF THE ENERGETIC CONSUMPTION FOR SOIL DIGGING MACHINES IN GREENHOUSES

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

ZISC Neural Network Base Indicator for Classification Complexity Estimation

Hybrid System Identification: An SDP Approach

Pattern Classification using Simplified Neural Networks with Pruning Algorithm

Detection and Estimation Theory

Ensemble Based on Data Envelopment Analysis

Tactics Box 2.1 Interpreting Position-versus-Time Graphs

An Improved Particle Filter with Applications in Ballistic Target Tracking

Optimization of Flywheel Weight using Genetic Algorithm

DISSIMILARITY MEASURES FOR ICA-BASED SOURCE NUMBER ESTIMATION. Seungchul Lee 2 2. University of Michigan. Ann Arbor, MI, USA.

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

A New Approach to Solving Dynamic Traveling Salesman Problems

Probability Distributions

W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS

The linear sampling method and the MUSIC algorithm

State Estimation Problem for the Action Potential Modeling in Purkinje Fibers

Principal Components Analysis

List Scheduling and LPT Oliver Braun (09/05/2017)

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Chapter 2 General Properties of Radiation Detectors

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Transcription:

International Journal of Maritie, Trade & Econoic Issues pp. 109-130 Volue I, Issue (1), 2013 Forecasting Financial Indices: The Baltic Dry Indices Eleftherios I. Thalassinos 1, Mike P. Hanias 2, Panayiotis G. Curtis 3, John E. Thalassinos 4 Abstract: The ain ai of this paper is to use chaos ethodology in an attept to predict the Baltic Dry Indices (BDI, BCI, BPI) using the invariant paraeters of the reconstructed strange attractor that governs the syste s evolution. This is the result of the new eerging field in econo-physics which ainly consists of autonoous physic-atheatical odels that have been already applied to financial analysis. The proposed ethodology is estiating the optial delay tie and the iniu ebedding diension with the ethod of False Nearest Neighbors (FNN). Monitoring the trajectories of the corresponding strange attractor we achieved a 30, 60, 90 and 120 tie steps out of saple prediction. Key Words: Chaos ethodology, False Nearest Neighbors, Baltic Dry Indices JEL Classification: C02, C14, C22 1 Corresponding Author: Professor, University of Piraeus. Departent of Maritie Studies, e-ail: thalassi@unipi.gr, thalassinos@ersj.eu. 2 TEI Chalkidas, Athens,Greece, e-ail: hanias@teihal.gr 3 TEI Chalkidas, Athens, Greece, e-ail: pcurtis@teihal.gr 4 PhD University of Piraeus, Piraeus, Greece

110 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos 1. Introduction Predicting Baltic Dry Indices is possible applying algoriths used in physical sciences. This article cobines finance and non linear ethods fro chaos theory to exaine the predictability of the Baltic Dry Indices. The proposed ethodology applies non linear tie series analysis for the BCI, BDI and BPI indices covering the period fro 04-01-2000 until 04-01-2008. In particular the ethod of the False Nearest Neighbor (FNN) is used in the first step to evaluate the invariant paraeter of the syste as the iniu ebedding diension. In a second stage using the reconstructed state space the article achieves an out of saple ulti step tie series prediction. The ethodology is very dynaic copared to traditional ones (Thalassinos et al., 2009). The ost iportant property of the proposed ethodology is the fact that there is no need to know fro trial to error soe constants to fit and extrapolate the tie series. The ethodology calculates the invariant paraeters of the syste itself. The fact that shipping indices are sensitive in irregular shocks and crises which are innate eleents in chaotic systes, their predictability is uch easier using chaotic ethodology than any other forecasting ethod. Other benefits as they are pointed out in Thalassinos et al., (2009) are: The possibility to extract inforation about a coplex dynaic syste, which generates several observed tie series by using only one of the. To analyze the iage-syste with the sae topology that preserves the ain characteristics of the genuine syste. The article cobines aritie tie series daily data for the period of 04-01-2000 to 04-01-2008 (total nuber of observations 2000) with chaos ethodology to exaine the predictability of the three Baltic Dry Indices as the ost characteristic indices in the aritie industry naely the BCI, BDI and BPI. 2. BCI Tie Series According to the theory of observed chaotic data (Abarbanel, 1996; Sprott, 2003; Hanias et al., 2007a, 2007b; Thalassinos et al., 2009) any non-linear tie series can be presented as a set of signals x=x(t) as it shown at Figure 1. The sapling rate is Δt=1 day and the nuber of data N=2000. As it is presented in Figure 1 the corresponding index had a significant nuber of structural shifts in the period under study with a ax of 16,000 and a in of 1,000 points. Fro the tie series plots of the BCI in Figure 1, 1700 data points has been selected as the training data set, in other words the data that are used for the state space reconstruction and the other 300 data points as the test data set for out of saple period prediction.

Forecasting Financial Indices: The Baltic Dry Indices 111 Figure 1: Tie Series plots of the BCI 18000 16000 1 12000 10000 BCI 8000 6000 2000 0 3. State space reconstruction 0 500 1000 1500 2000 Tie units (days) 3.1 Tie delay τ X r Fro the given data a vector i, i=1, 2, N, where N=1700, in the order diensional phase space given by the following relation (Kantz et al., 1997; Takens, 1981; Hanias et al., 2007a, 2007b; Thalassinos et al., 2009) is constructed as shown in equation (1): X r i = {xi, xi-τ, xi-2τ,., xi+(-1)τ} (1) X r where i represents a point in the diensional phase space in which the attractor is ebedded each tie, where τ is the tie delay τ = iδt. The eleent xi represents a value of the exained scalar tie series in tie, corresponding to the i-th coponent of the tie series. By using this ethod the phase space reconstruction to the proble of proper deterining suitable values of values of and τ is constructed. The next step is to find the tie delay (τ) and the ebedding diension () without using any other inforation apart fro the historical values of the indices. Equation (2) is used to calculate the tie delay by using the tie-delayed utual inforation proposed by Fraser et al., 1986 and Abarbanel, 1996. p( xi, xi+ τ ) I( τ ) = p( x ) i, xi+ τ log 2 ( ) ( ) x x p x + τ i p x i, i i+ τ (2) In equation (2), p(xi) is the probability of value xi and p(xi, xi+τ) denotes joint probability. I(τ) shows the inforation (in bits) being extracted fro the value in tie xi about the value in tie xi+ττ. The function I can be thought of as a nonlinear generalization of the autocorrelation function. For a rando process x(t) the I(t), is a

I 112 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos easure of the inforation about x(t+τ) contained in x(t). The first nadir of I(τ) gives the delay, tau0, such that x(t+tau0) adds axial inforation to that already known fro x(t). This tau0 is returned as an estiate of the proper tie lag for a delay ebedding of the given tie series. The tie delay is calculated as the first iniu of the utual inforation (Kantz et al., 1997; Fraser et al., 1986; Casdagli et al., 1991). Mutual inforation against the tie delays (with a iniu at 54 tie steps) for our tie series is presented in Figure 2. Figure 2: Mutual inforation I vs. tie delay τ 2.0 1.8 1.6 1.4 1.2 1.0 0.8 0.6 0 50 100 150 200 250 300 3.2 Ebedding diension After obtaining the satisfactory value of τ, the ebedding diension is to be deterined in order to finish the phase space reconstruction. For this purpose the ethod of False Nearest Neighbors (Kantz et al., 1997 Kennel et al., 1992) is used. More specifically, the ethod is based on a fact that when ebedding diension is too low, the trajectory in the phase space will cross itself. If we are able to detect these crossings, we ay decide whether the used is large enough for correct reconstruction of the original phase space, when no intersections occur or not. When intersections are present for a given, the ebedding diension is too low and we have to increase it at least by one. Then, we test the eventual presence of selfcrossings again (Kennel et al., 1992; Abarbanel 1996). The practical realization of the described ethod is based on testing of the neighboring points in the - diensional phase space. Typically, we take a certain aount of points in the phase space and find the nearest neighbor to each of the. Then we copute distances for all these pairs and also their distances in the (+1) diensional phase space. The rate of these distances is given by equation (3) as follows: y i ( + 1) y n( i) ( + 1) P = y i ( ) y n( i) ( ) (3) where yi() represents the reconstructed vector, belonging to the i-th point in the - diensional phase space and index the n(i) denotes the nearest neighbour to the i-th point. If P is greater than soe value Pax, we call this pair of points False Nearest Neighbors (i.e. neighbors, which arise fro trajectory self-intersection and not fro τ

Forecasting Financial Indices: The Baltic Dry Indices 113 the closeness in the original phase space). In the ideal case, when the nuber of false neighbors falls to zero, then the value of is found. For this purpose we copute the rate of false nearest neighbours in the reconstructed phase space using the forula in equation (4): xi+ τ xn( i) + τ RA (4) where RA is the radius of the attractor, N 1 R A = x i x ( 5 ) N i = 1 and N 1 x = xi N i= 1 (6) is the average value of tie series. P P When the following criterion ax, (7) is satisfied then it can be used to distinguish between true and false neighbours (Kennel et al., 1992). The diension is found when the percent of false nearest neighbors decreases below soe liit, (Kugiutzis et al., 1994), so we choose Pax=10 as used typically. Before we apply the above procedure, we ust deterine the Theiler window for out tie series and exclude all pairs of points in the original series which are teporally correlated and are closer than this value of Theiler window. For this purpose we produce space tie separation plots (Kantz et al., 1997) as shown in Figure 3(a). Figure 3: Space tie separation plot Spatial Separation 0 1000 2000 3000 6000 p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation 0.0 0.0004 0.0008 0 1000 3000 0 1000 2000 3000 Median Spatial Separation olag = 53 to 117 0 50 100 150 0 50 100 150 Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower).

114 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos The space tie separation plots where produced with a desired ebedding diension 5, τ=54, and the probability associated with the first contour equal to 0.2 In Figure 3 we had plot a suary of the space-tie contours including a density function estiate of the edian contour in addition to a suggested range of suitable orbital lags. In the latter case, the ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve. The suggested range for a suitable orbital lag is based on the range of values that first escape this cross-hatched region, so we can choose a Theiler window fro 53 to 117. In our case we choose the Theiler window to be 65. Then we used atlab code to calculate the quantity P. The rate of false neighbors that is under the above liit Pax=10 is achieved for = 4, thus this value should be suitable for the purpose of phase space reconstruction. This is shown in Figure 4 for our tie series. Figure 4: Percent of False Nearest Neighbors nuber vs. 40 30 FNN% 20 10 0 4. Tie Series Prediction of BCI 0 2 4 6 8 10 The next step is to predict the evolution of BCI by coputing weighted average of evolution of close neighbors of the predicted state in the reconstructed phase space (Miksovsky et al., 2007; Sta et al., 1998). The reconstructed -diensional signal projected into the state space can exhibit a range of trajectories, soe of which have structures or patterns that can be used for syste prediction and odeling. Essentially, in order to predict k steps into the future fro the last -diensional vector point } N }, we have to find all the nearest neighbors NN in the B ( ε-neighborhood of this point. To be ore specific, let s set ε xn ) to be the set of points within ε of } N B ( ) (i.e. the ε-ball). Thus any point in ε xn is closer to

Forecasting Financial Indices: The Baltic Dry Indices 115 the } N than ε. All these points NN } coe fro the previous trajectories of the syste and hence we can follow their evolution k-steps into the future NN + k}. The final prediction for the point } N is obtained by averaging over all neighbors projections k-steps into the future. The algorith can be written as in equation (8) as follows: 1 N + k } = x NN + k B ( x ) NN X NN B ( xnn ) (8) B ( x NN ) where denotes the nuber of nearest neighbors in the neighborhood of the point } N ( Kantz et al., 1997). As an exaple we suppose that we want tο predict k=2 steps ahead. The basic principle of the prediction odel is visualized in Figure 5. The blue dot N} represents the last known saple, fro which we want to predict one and two steps into the future. The blue circles represent ε- neighborhoods in which three nearest neighbors were found. Figure 5: Basic prediction principle of the siple deterinistic odel } N N + 2 } N 2 } 1} N N } { } 1 x N + The next step in the algorith is to check that the projections, one and two steps into the past, of the points in NN } are also nearest neighbors of the two previous

116 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos { readings } xn 1 and N 2} respectively. This criterion excludes unrelated trajectories that enter and leave the ε-neighborhood of N} but do not track back to ε- neighborhoods of } N 1 and N 2}, thus aking the unsuitable for prediction. Assuing that any nearest neighbors have been found and checked using the criterion detailed previously, we project their trajectories into the future and average the to get results for } N + 1 and N + 2}. We used the values of τ and fro our previous analysis so the appropriate tie delay τ was chosen to be τ=54. We use as ebedding diension the 2* = 8 (Sprott J. C) and for the optiu nuber of nearest neighbors we used the value of ebedding diension = 4. These values of ebedding diension and nuber of nearest neighbors gave the better results for k=30 tie steps ahead. We apply the procedure for in saple forecasting until data point 1700 as shown at Figure 6 then we applied the procedure for out of saple prediction fro data point 1700 to data point 1730 as shown in Figure 7. Figure 6: and in saple predicted tie series for k=30 days ahead 10000 8000 Predicted k=30 days ahead 6000 BCI 2000 0 0 250 500 750 1000 1250 1500 Tie steps (days)

Forecasting Financial Indices: The Baltic Dry Indices 117 Figure7: and out of saple predicted tie series for k=30 days ahead 6000 5900 5800 Predicted k=30 days ahead 5700 5600 BCI 5500 5400 5300 5200 5100 1700 1705 1710 1715 1720 1725 1730 Tie steps (days) and predicted tie series for k=60, 90, 120 tie steps ahead are presented in Figures 8, 9, 10 respectively for out of saple period. Figure 8: and out of saple predicted tie series for k=60 days ahead 7000 6800 6600 Predicted k=60 days ahead 6400 6200 BCI 6000 5800 5600 5400 5200 1700 1710 1720 1730 1740 1750 1760 Tie steps (days)

118 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 9: and out of saple predicted tie series for k=90 tie steps ahead 7000 6800 6600 Predicted k=90 days ahead 6400 6200 BCI 6000 5800 5600 5400 5200 1700 1720 1740 1760 1780 Tie steps (days) Figure 10: and out of saple predicted tie series for k=120 tie steps ahead BCI 8000 7800 7600 7400 7200 7000 6800 6600 6400 6200 6000 5800 5600 5400 5200 Predicted k=120 days ahead 1700 1720 1740 1760 1780 1800 1820 Tie Index (days)

Forecasting Financial Indices: The Baltic Dry Indices 119 The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 8.99x10-2, 9.54x10-2, 2.17x10-1, 2.26x10-1 for k=30, 60, 90, 120 respectively. 5. Tie Series Prediction of BDI The BDI tie series is presented as a signal x=x(t) as it shown in Figure 11. It covers data fro 04-01-2000 to 04-01-2008. The sapling rate was Δt=1 day and the nuber of data are N=2000. Figure 11: BDI Tie Series 12000 10000 8000 BDI 6000 2000 0 0 500 1000 1500 2000 Tie units (days) Fro this tie series we have choose 1700 data as the training data set, in other words the data that we used for the state space reconstruction and the other 300 data as the test data set for our out of saple prediction. We used the sae procedure as before and we had estiated the delay tie, Theiler window and ebedding diension. Mutual inforation against the tie delays (with a iniu at 55 tie steps) for BDI tie series is presented in Figure 12.

I 120 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 12: Mutual inforation I vs. tie delay τ 2.0 1.8 1.6 1.4 1.2 1.0 0.8 0.6 0 20 40 60 80 100 The space tie separation plot and the density function estiation plots are shown in Figure 13. Fro this plot we estiate the Theiler window to be 100. Figure 13: Space tie separation plot τ Spatial Separation 0 1000 2000 3000 p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation 0.0 0.0004 0.0010 0 500 1500-500 0 500 1000 1500 2000 2500 Median Spatial Separation olag = 48 to 116 0 50 100 150 0 50 100 150 Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower). The percent of false nearest neighbors nuber FNN vs. is shown in Figure 14. Fro this it is clear that the ebedding diension is 4.

Forecasting Financial Indices: The Baltic Dry Indices 121 Figure 14: Percent of false nearest neighbors nuber FNN vs. 40 35 30 25 FNN% 20 15 10 5 0 0 2 4 6 8 10 The next step is to predict 30, 60, 90 and 120 tie steps ahead. Figures 15, 16, 17, 18 and 19 are shown the in saple and out of saple period predictions. Figure 15: and in saple predicted tie series for k=30 days ahead 12000 10000 Predicted k=30 days ahead 8000 BDI 6000 2000 0 0 500 1000 1500 Tie units (days)

122 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 16: and out of saple predicted tie series for k=30 days ahead 4800 4600 Predicted k=30 days ahead 4400 4200 BDI 3800 3600 3400 3200 3000 1700 1705 1710 1715 1720 1725 1730 Tie units (days) Figure 17: and out of saple predicted tie series for k=60 days ahead 4800 4600 Predicted k=60 days ahead 4400 4200 BDI 3800 3600 3400 3200 3000 1700 1710 1720 1730 1740 1750 1760 Tie units (days)

Forecasting Financial Indices: The Baltic Dry Indices 123 Figure 18: and out of saple predicted tie series for k=90 tie steps ahead 4800 4600 Predicted k=90 days ahead 4400 4200 BDI 3800 3600 3400 3200 3000 1700 1720 1740 1760 1780 Tie units (days) Figure 19: and out of saple predicted tie series for k=120 tie steps ahead 4800 4600 Predicted k=120 days ahead 4400 4200 BDI 3800 3600 3400 3200 3000 1700 1720 1740 1760 1780 1800 1820 Tie units(days) The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 5.68x10-2, 5.99x10-2, 6.53x10-2, 6.80x10-2 for k=30, 60, 90 and 120 respectively.

124 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos 5. Tie Series Prediction of BPI The BPI tie series is presented as a signal x=x(t) as it shown in Figure 20. It covers data fro 04-01-2000 to 04-01-2008. The sapling rate was Δt=1 day and the nuber of data are N=2000. Figure 20: BPI tie series 7000 6000 BPI 3000 2000 1000 0 0 200 400 600 800 1000 1200 1400 1600 1800 2000 Tie units (days) Fro this tie series we have choose 1700 data as the training data set, in other words the data that we used for the state space reconstruction and the other 300 data as the test data set for our out of saple prediction. We used the sae procedure as before and we have estiated the delay tie, Theiler window and ebedding diension. Mutual inforation against the tie delays (with a iniu at 55 tie steps) for BDI tie series is presented in Figure 21.

I Forecasting Financial Indices: The Baltic Dry Indices 125 Figure 21: Mutual inforation I vs. tie delay τ 2.0 1.8 1.6 1.4 1.2 1.0 0.8 0 20 40 60 80 100 The space tie separation plot and density function estiation plots are shown in Figure 22. Fro this plot we estiate the Theiler window to be 100. Figure 22: Space tie separation plot τ Spatial Separation 0 1000 2000 3000 0 50 100 150 p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation 0.0 0.0004 0 500 1500 2500 0 1000 2000 3000 Median Spatial Separation olag = 59 to 117 0 50 100 150 Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower). The percent of false nearest neighbors nuber FNN vs. is shown in Figure 23. Fro this fig it s clear that the ebedding diension is 4.

126 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 23: Percent of false nearest neighbors nuber FNN vs. 40 35 30 25 FNN% 20 15 10 5 0 0 2 4 6 8 10 The next step is to predict 30, 60, 90 and 120 tie steps ahead. Figures 24, 25, 26, 27 and 28 are shown the in saple and out of saple period predictions. Figure 24: and in saple predicted tie series for k=30 days ahead 10000 8000 Predicted k=30 days ahead 6000 BPI 2000 0 0 500 1000 1500 Tie units (days)

Forecasting Financial Indices: The Baltic Dry Indices 127 Figure 25: and out of saple predicted tie series for k=30 days ahead 4800 4600 Predicted k=30 days ahead 4400 4200 BPI 3800 3600 3400 3200 3000 1700 1705 1710 1715 1720 1725 1730 Tie units (days) Figure 26: and out of saple predicted tie series for k=60 days ahead 4800 4600 Predicted k=60 days ahead 4400 4200 BPI 3800 3600 3400 3200 3000 1700 1710 1720 1730 1740 1750 1760 Tie units (days)

128 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 27: and out of saple predicted tie series for k=90 days ahead 4800 4600 Predicted k=90 days ahead 4400 4200 BPI 3800 3600 3400 3200 3000 1700 1720 1740 1760 1780 Tie units (days) Figure 28: and out of saple predicted tie series for k=120 days ahead. BPI 6000 5800 5600 5400 5200 4800 4600 4400 4200 3800 3600 3400 3200 Predicted k=120 days ahead 3000 1700 1720 1740 1760 1780 1800 1820 Tie units (days)

Forecasting Financial Indices: The Baltic Dry Indices 129 The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 7.10x10-2, 7.56x10-2, 1.24x10-1, 2.36x10-1 for k=30, 60, 90 and 120 respectively. 6. Conclusion In this paper chaotic analysis has been used to predict Baltic Dry Indices tie series. After estiating the iniu ebedding diension, the proposed ethodology has pointed out that the syste is characterized as a high diension chaotic. Fro reconstruction of the systes strange attractors, it has been achieved a 30, 60, 90 and 120 out of saple tie steps prediction. In Table 1 the RMS values of the corresponding prediction are shown. Table 1: RMS values RMS 30 DAYS 60 DAYS 90 DAYS 120 DAYS BDI 5.68x10-2 5.99x10-2 6.53x10-2 6.80x10-2 BCI 8.99x10-2 9.54x10-2 2.17x10-1 2.26x10-1 BPI 7.10x10-2 7.56x10-2 1.24x10-1 2.36x10-1 It is clear that the BDI has the iniu error and gives the best prediction copared to the other two indices. The prediction power of the suggested ethod is liited by the properties of the original syste and the series alone. Because the series represents the only source of inforation for the syste it is iportant to be as long as possible. Too short tie series will not worsen the prediction only but it ay also ake the proper reconstruction of the phase space ipossible. Another iportant liitation factor is the eventual containation by noise evidently, the ore noise is included in the series, the less accurate result can be gained. However the prediction horizon of 120 days would be useful for econoical analysis as it can reveal the trend in a very good anner. References Abarbanel, H.D.I. (1996), Analysis of Observed Chaotic Data, Springer, New York. Casdagli, M., Eubank, S., Farer, J.D. and Gibson, J. (1991), State Space Reconstruction in the Presence of Noise, Physica D, 51, pp. 52-98. Fraser, A.M., Swinney, H.L. (1986), Independent coordinates for strange attractors fro utual inforation, Physics Review A, pp. 33, 1134. Hanias, M.P., Curtis, G.P. and Thalassinos, E.J. (2007), Non-Linear Dynaics and Chaos: The Case of the Price Indicator at the Athens Stock Exchange, International Research Journal of Finance and Econoics, Issue 11, pp. 154-163. Hanias, M.P., Curtis, G.P. and Thalassinos, E.J. (2007), Prediction with Neural Networks: The Athens Stock Exchange Price Indicator, European Journal of Econoics, Finance And Adinistrative Sciences, Issue 9.

130 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Hanias, M.P., Karras, A.D. (2007), Efficient Non Linear Tie Series Prediction Using Non Linear Signal Analysis and Neural Networks in Chaotic Diode Resonator Circuits, Springer Berlin/Heidelberg, Lecture Notes in Coputer Science, Advances in Data Mining. Theoretical Aspects and Applications, Vol. 4597, pp. 329-338. Kantz, H., Schreiber, T. (1997), Nonlinear Tie Series Analysis, Cabridge University Press, Cabridge. Kennel, M.B., Brown, R., Abarbanel, H.D.I. (1992). Deterining ebedding diension for phase-space reconstruction using a geoetrical construction, Physics Review A, 45, 3403. Kugiutzis, D., Lillekjendlie, B., Christophersen, N. (1994) Chaotic Tie Series, Modelling Identification and Control, 15, 205. Miksovsky, J., Raidl, A. (2007), On Soe Nonlinear Methods of Meteorological Tie Series Analysis, Proceedings of WDS Conference. Sta, C.J., Pijn, J.P.N., Pritchard, W.S. (1998), Reliable Detection of Nonlinearity in Experiental Tie Series with Strong Periodic Coponent, Physica D, Vol. 112. Sprott, J.C. (2003), Chaos and Tie series Analysis, Oxford University Press. Takens, F. (1981), Detecting Strange Attractors in Turbulence, Lecture notes in Matheatics, Vol. 898, Springer, New York. Thalassinos, I.E., Hanias M.P., Curtis, G.P., and Thalassinos, E.J. (2009), Chaos Theory: Forecasting the Freight Rate of an Oil Tanker, International Journal of Coputational Econoics and Econoetrics, Vol. X, Issue 1.