Computational Finance and Business Intelligence (CFBI) Session 2

Time and Date: 13:25 - 15:05 on 14th June 2017

Room: HG D 7.1

Chair: Yong Shi

180 Pension Fund Asset Allocation: A Mean-Variance Model with CVaR Constraints [abstract]
Abstract: In this paper, we first review some important aspects of asset allocation for some typical large Social Security Reserve Funds (SSRFs) in the world. Then we present the mean-variance model with CVaR constraints as asset allocation methodology. Concerning the real circumstance in China, we apply the model to pension fund asset allocation. The empirical results show that to maintain purchase power of pension fund, certain proportion should be invested in stocks as well as direct equity investments. We also find that time horizon significantly influence asset allocation of pension fund. If time horizon is longer, more allocations to stocks and equity investments help the pension fund to achieve better performance.
Yibing Chen, Xiaolei Sun and Jianping Li
304 Short-term Electricity Price Forecasting with Empirical Mode Decomposition based Ensemble Kernel Machines [abstract]
Abstract: Short-term electricity price forecasting is a critical issue for the operation of both electricity markets and power systems. An ensemble method composed of Empirical Mode Decomposition (EMD), Kernel Ridge Regression (KRR) and Support Vector Regression (SVR) is presented in this paper. For this purpose, the electricity price signal was first decomposed into several intrinsic mode functions (IMFs) by EMD, followed by a KRR which was used to model each extracted IMF and predict the tendencies. Finally, the prediction results of all IMFs were combined by an SVR to obtain an aggregated output for electricity price. The electricity price datasets from Australian Energy Market Operator (AEMO) are used to test the effectiveness of the proposed EMD-KRR-SVR approach. Simulation results demonstrated attractiveness of the proposed method based on both accuracy and efficiency.
Xueheng Qiu, Ponnuthurai Suganthan and Gehan Amaratunga
534 Russian Interbank Network Reconstruction via Metaheuristic Algorithm [abstract]
Abstract: We propose an application of the metaheuristic algorithm to interbank market reconstruction. This is a simulated annealing algorithm that is considered, and it is Russian interbank market that this is applied to. We consider a network with the 504 largest Russian banks to be compared with corresponding empirical results obtained by Leonidov & Rumyantsev. The topological properties of a graph to be fitted was average in- and out- degree, density and average clustering coefficient. The proposed algorithm of network reconstruction is compared with maximum entropy, minimum density, low density methods. Results shown the efficiency of the approach.
Valentina Y. Guleva, Vyacheslav Povazhnyuk, Klavdiya Bochenina and Alexander Boukhanovsky
58 Identification of failing banks using Clustering with self-organising neural networks [abstract]
Abstract: This paper presents experimental results of cluster analysis using self organising neural networks for identifying failing banks. The paper first describes major reasons and likelihoods of bank failures. Then it demonstrates an application of a self-organising neural network and presents results of the study. Findings of the paper demonstrate that a self-organising neural network is a powerful tool for identifying potentially failing banks. Finally, the paper discusses some of the limitations of cluster analysis related to understanding of the exact meaning of each cluster.
Michael Negnevitsky
570 Clustering algorithms for Risk-Adjusted Portfolio Construction [abstract]
Abstract: This paper presents the performance of seven portfolios created using clustering analysis techniques to sort out assets into categories and then applying classical optimization inside every cluster to select best assets inside each asset category. The proposed clustering algorithms are tested constructing portfolios and measuring their performances over a two month dataset of 1-minute asset returns from a sample of 175 assets of the Russell 1000® index. A three-week sliding window is used for model calibration, leaving an out of sample period of five weeks for testing. Model calibration is done weekly. Three different rebalancing periods are tested: every 1, 2 and 4 hours. The results show that all clustering algorithms produce more stable portfolios with similar volatility. In this sense, the portfolios volatilities generated by clustering algorithms are smaller when compare to the portfolio obtained using classical Mean-Variance Optimization (MVO) over all the dataset. Hierarchical clustering algorithms achieve the best financial performance obtaining an adequate trade-off between accumulated financial returns and the risk-adjusted measure Omega ratio during the out of sample testing period.
Diego León, Arbey Aragón, Javier Sandoval, Germán Hernández, Andrés Arévalo and Jaime Niño
167 Study of the periodicity in Euro-US Dollar exchange rates using local alignment and random matrixes [abstract]
Abstract: The purpose of this study was to detect latent periodicity in the presence of deletions or insertions in the analyzed data, when the points of deletions or insertions are unknown. A mathematical method was developed to search for periodicity in the numerical series, using dynamic programming and random matrices. The developed method was applied to search for periodicity in the Euro/Dollar (Eu/$) exchange rate. Period length equal to 24 and 25 h were found. The reasons for the existence of the periodicity in the financial time series are discussed. The results can find application in computer systems, for the purpose of forecasting exchange rates.
Eugene Korotkov and Maria Korotkova