Entropic Dynamic Time Warping Kernels for Co-evolving Financial Time Series Analysis

Abstract

In this work, we develop a novel framework to measure the similarity between dynamic financial networks, i.e., time-varying financial networks. Particularly, we explore whether the proposed similarity measure can be employed to understand the structural evolution of the financial networks with time. For a set of time-varying financial networks with each vertex representing the individual time series of a different stock and each edge between a pair of time series representing the absolute value of their Pearson correlation, our start point is to compute the commute time matrix associated with the weighted adjacency matrix of the network structures, where each element of the matrix can be seen as the enhanced correlation value between pairwise stocks. For each network, we show how the commute time matrix allows us to identify a reliable set of dominant correlated time series as well as an associated dominant probability distribution of the stock belonging to this set. Furthermore, we represent each original network as a discrete dominant Shannon entropy time series computed from the dominant probability distribution. With the dominant entropy time series for each pair of financial networks to hand, we develop a similarity measure based on the classical dynamic time warping framework, for analyzing the financial time-varying networks. We show that the proposed similarity measure is positive definite and thus corresponds to a kernel measure on graphs. The proposed kernel bridges the gap between graph kernels and the classical dynamic time warping framework for multiple financial time series analysis. Experiments on time-varying networks extracted through New York Stock Exchange (NYSE) database demonstrate the effectiveness of the proposed approach.

arXiv commentPreviously, the original version of this manuscript appeared as arXiv:1902.09947v2, that was submitted as a replacement by a mistake. Now, that article has been replaced to correct the error, and this manuscript is distinct from that article

References in corpus (13)

• Dynamic Graph Convolutional Networks
• Change-Point Detection in Time-Series Data by Relative Density-Ratio Estimation
• The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
• On Valid Optimal Assignment Kernels and Applications to Graph Classification
• The Multiscale Laplacian Graph Kernel
• Centrality measures and thermodynamic formalism for complex networks
• Thermodynamic characterization of networks using graph polynomials
• Entropy distribution and condensation in random networks with a given degree distribution
• A tree-based kernel for graphs with continuous attributes
• Quantum-Classical Transitions in Complex Networks
• Stochastic Graphlet Embedding
• Modular Dynamics of Financial Market Networks
• Thermodynamic forces, flows, and Onsager coefficients in complex networks

Cited by in corpus (4)

• GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction
• Approach to Data Science with Multiscale Information Theory
• Generalized Constraints as A New Mathematical Problem in Artificial Intelligence: A Review and Perspective
• Estimating Fund-Raising Performance for Start-up Projects from a Market Graph Perspective