scholarly journals Non-Uniform Embedding Scheme and Low-Dimensional Approximation Methods for Causality Detection

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 745 ◽  
Author(s):  
Angeliki Papana
Keyword(s):  
Computational Cost ◽  
Late Results ◽  
Coupled Systems ◽  
Detection Methods ◽  
High Dimensional ◽  
Uniform Embedding ◽  
Dimensional Approximation ◽  
Partial Transfer ◽  
Low Dimensional ◽  
Multivariate Systems

Information causality measures have proven to be very effective in uncovering the connectivity patterns of multivariate systems. The non-uniform embedding (NUE) scheme has been developed to address the “curse of dimensionality”, since the estimation relies on high-dimensional conditional mutual information (CMI) terms. Although the NUE scheme is a dimension reduction technique, the estimation of high-dimensional CMIs is still required. A possible solution is the utilization of low-dimensional approximation (LA) methods for the computation of CMIs. In this study, we aim to provide useful insights regarding the effectiveness of causality measures that rely on NUE and/or on LA methods. In a comparative study, three causality detection methods are evaluated, namely partial transfer entropy (PTE) defined using uniform embedding, PTE using the NUE scheme (PTENUE), and PTE utilizing both NUE and an LA method (LATE). Results from simulations on well known coupled systems suggest the superiority of PTENUE over the other two measures in identifying the true causal effects, having also the least computational cost. The effectiveness of PTENUE is also demonstrated in a real application, where insights are presented regarding the leading forces in financial data.

scholarly journals From Low-Dimensional Synchronous Chaos to High-Dimensional Desynchronous Spatiotemporal Chaos in Coupled Systems

2000 ◽  
Vol 85 (16) ◽  
pp. 3377-3380 ◽  
Author(s):  
Gang Hu ◽  
Ying Zhang ◽  
Hilda A. Cerdeira ◽  
Shigang Chen
Keyword(s):  
Spatiotemporal Chaos ◽  
Coupled Systems ◽  
High Dimensional ◽  
Low Dimensional

An Efficient Wiener Path Integral Technique Formulation for Stochastic Response Determination of Nonlinear MDOF Systems

2015 ◽  
Vol 82 (10) ◽  
Author(s):  
Ioannis A. Kougioumtzoglou ◽  
Alberto Di Matteo ◽  
Pol D. Spanos ◽  
Antonina Pirrotta ◽  
Mario Di Paola
Keyword(s):  
Path Integral ◽  
Computational Cost ◽  
High Dimensional ◽  
System Response ◽  
Stochastic Response ◽  
Mdof Systems ◽  
Low Dimensional ◽  
Response Determination ◽  
Efficiency And Reliability

The recently developed approximate Wiener path integral (WPI) technique for determining the stochastic response of nonlinear/hysteretic multi-degree-of-freedom (MDOF) systems has proven to be reliable and significantly more efficient than a Monte Carlo simulation (MCS) treatment of the problem for low-dimensional systems. Nevertheless, the standard implementation of the WPI technique can be computationally cumbersome for relatively high-dimensional MDOF systems. In this paper, a novel WPI technique formulation/implementation is developed by combining the “localization” capabilities of the WPI solution framework with an appropriately chosen expansion for approximating the system response PDF. It is shown that, for the case of relatively high-dimensional systems, the herein proposed implementation can drastically decrease the associated computational cost by several orders of magnitude, as compared to both the standard WPI technique and an MCS approach. Several numerical examples are included, whereas comparisons with pertinent MCS data demonstrate the efficiency and reliability of the technique.

scholarly journals Detecting Causality in Multivariate Time Series via Non-Uniform Embedding

Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1233 ◽  
Author(s):  
Ziyu Jia ◽  
Youfang Lin ◽  
Zehui Jiao ◽  
Yan Ma ◽  
Jing Wang
Keyword(s):  
Time Series ◽  
Mutual Information ◽  
Chaotic Systems ◽  
Multivariate Time Series ◽  
Conditional Mutual Information ◽  
Uniform Embedding ◽  
Actual Application ◽  
Dimensional Approximation ◽  
Coupling Strengths ◽  
Low Dimensional

Causal analysis based on non-uniform embedding schemes is an important way to detect the underlying interactions between dynamic systems. However, there are still some obstacles to estimating high-dimensional conditional mutual information and forming optimal mixed embedding vector in traditional non-uniform embedding schemes. In this study, we present a new non-uniform embedding method framed in information theory to detect causality for multivariate time series, named LM-PMIME, which integrates the low-dimensional approximation of conditional mutual information and the mixed search strategy for the construction of the mixed embedding vector. We apply the proposed method to simulations of linear stochastic, nonlinear stochastic, and chaotic systems, demonstrating its superiority over partial conditional mutual information from mixed embedding (PMIME) method. Moreover, the proposed method works well for multivariate time series with weak coupling strengths, especially for chaotic systems. In the actual application, we show its applicability to epilepsy multichannel electrocorticographic recordings.

scholarly journals High-dimensional Similarity Learning via Dual-sparse Random Projection

2018 ◽  
Author(s):  
Dezhong Yao ◽  
Peilin Zhao ◽  
Tuan-Anh Nguyen Pham ◽  
Gao Cong
Keyword(s):  
Dimensional Space ◽  
Computational Cost ◽  
Optimal Solution ◽  
Random Projection ◽  
Projection Methods ◽  
Low Rank ◽  
High Dimensional ◽  
Similarity Learning ◽  
Reduced Space ◽  
Low Dimensional

We investigate how to adopt dual random projection for high-dimensional similarity learning. For a high-dimensional similarity learning problem, projection is usually adopted to map high-dimensional features into low-dimensional space, in order to reduce the computational cost. However, dimensionality reduction method sometimes results in unstable performance due to the suboptimal solution in original space. In this paper, we propose a dual random projection framework for similarity learning to recover the original optimal solution from subspace optimal solution. Previous dual random projection methods usually make strong assumptions about the data, which need to be low rank or have a large margin. Those assumptions limit dual random projection applications in similarity learning. Thus, we adopt a dual-sparse regularized random projection method that introduces a sparse regularizer into the reduced dual problem. As the original dual solution is a sparse one, applying a sparse regularizer in the reduced space relaxes the low-rank assumption. Experimental results show that our method enjoys higher effectiveness and efficiency than state-of-the-art solutions.

scholarly journals Classification of Brainwaves for Sleep Stages by High-Dimensional FFT Features from EEG Signals

2020 ◽  
Vol 10 (5) ◽  
pp. 1797 ◽  
Author(s):  
Mera Kartika Delimayanti ◽  
Bedy Purnama ◽  
Ngoc Giang Nguyen ◽  
Mohammad Reza Faisal ◽  
Kunti Robiatul Mahmudah ◽  
...  
Keyword(s):  
Machine Learning ◽  
Sleep Stage ◽  
Machine Learning Algorithms ◽  
High Dimensional ◽  
Sleep Stages ◽  
Eeg Signals ◽  
Stage Classification ◽  
Sleep Stage Classification ◽  
Low Dimensional

Manual classification of sleep stage is a time-consuming but necessary step in the diagnosis and treatment of sleep disorders, and its automation has been an area of active study. The previous works have shown that low dimensional fast Fourier transform (FFT) features and many machine learning algorithms have been applied. In this paper, we demonstrate utilization of features extracted from EEG signals via FFT to improve the performance of automated sleep stage classification through machine learning methods. Unlike previous works using FFT, we incorporated thousands of FFT features in order to classify the sleep stages into 2–6 classes. Using the expanded version of Sleep-EDF dataset with 61 recordings, our method outperformed other state-of-the art methods. This result indicates that high dimensional FFT features in combination with a simple feature selection is effective for the improvement of automated sleep stage classification.

scholarly journals Computing Expectiles Using k-Nearest Neighbours Approach

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 645
Author(s):  
Muhammad Farooq ◽  
Sehrish Sarfraz ◽  
Christophe Chesneau ◽  
Mahmood Ul Hassan ◽  
Muhammad Ali Raza ◽  
...  
Keyword(s):  
Computational Cost ◽  
Real Life ◽  
Distance Measures ◽  
Computational Time ◽  
High Dimensional ◽  
Test Error ◽  
Nearest Neighbours ◽  
Comparable Performance ◽  
Asymmetric Least Squares ◽  
Low Computational Cost

Expectiles have gained considerable attention in recent years due to wide applications in many areas. In this study, the k-nearest neighbours approach, together with the asymmetric least squares loss function, called ex-kNN, is proposed for computing expectiles. Firstly, the effect of various distance measures on ex-kNN in terms of test error and computational time is evaluated. It is found that Canberra, Lorentzian, and Soergel distance measures lead to minimum test error, whereas Euclidean, Canberra, and Average of (L1,L∞) lead to a low computational cost. Secondly, the performance of ex-kNN is compared with existing packages er-boost and ex-svm for computing expectiles that are based on nine real life examples. Depending on the nature of data, the ex-kNN showed two to 10 times better performance than er-boost and comparable performance with ex-svm regarding test error. Computationally, the ex-kNN is found two to five times faster than ex-svm and much faster than er-boost, particularly, in the case of high dimensional data.

scholarly journals A Nonlinear Maximum Correntropy Information Filter for High-Dimensional Neural Decoding

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 743
Author(s):  
Xi Liu ◽  
Shuhang Chen ◽  
Xiang Shen ◽  
Xiang Zhang ◽  
Yiwen Wang
Keyword(s):  
State Estimation ◽  
Measurement Model ◽  
High Dimensional ◽  
Neural Firing ◽  
The Neural Network ◽  
Information Filter ◽  
Critical Technology ◽  
Dimensional Measurements ◽  
Non Gaussian ◽  
Low Dimensional

Neural signal decoding is a critical technology in brain machine interface (BMI) to interpret movement intention from multi-neural activity collected from paralyzed patients. As a commonly-used decoding algorithm, the Kalman filter is often applied to derive the movement states from high-dimensional neural firing observation. However, its performance is limited and less effective for noisy nonlinear neural systems with high-dimensional measurements. In this paper, we propose a nonlinear maximum correntropy information filter, aiming at better state estimation in the filtering process for a noisy high-dimensional measurement system. We reconstruct the measurement model between the high-dimensional measurements and low-dimensional states using the neural network, and derive the state estimation using the correntropy criterion to cope with the non-Gaussian noise and eliminate large initial uncertainty. Moreover, analyses of convergence and robustness are given. The effectiveness of the proposed algorithm is evaluated by applying it on multiple segments of neural spiking data from two rats to interpret the movement states when the subjects perform a two-lever discrimination task. Our results demonstrate better and more robust state estimation performance when compared with other filters.

PSS Business Case Map: Supporting Idea Generation in PSS Design

2012 ◽  
Author(s):  
Fumiya Akasaka ◽  
Kazuki Fujita ◽  
Yoshiki Shimomura
Keyword(s):  
Idea Generation ◽  
Business Case ◽  
Literature Survey ◽  
The Self ◽  
High Dimensional ◽  
Self Organizing Map ◽  
Two Dimensional ◽  
Service Type ◽  
Business Cases ◽  
Low Dimensional

This paper proposes the PSS Business Case Map as a tool to support designers’ idea generation in PSS design. The map visualizes the similarities among PSS business cases in a two-dimensional diagram. To make the map, PSS business cases are first collected by conducting, for example, a literature survey. The collected business cases are then classified from multiple aspects that characterize each case such as its product type, service type, target customer, and so on. Based on the results of this classification, the similarities among the cases are calculated and visualized by using the Self-Organizing Map (SOM) technique. A SOM is a type of artificial neural network that is trained using unsupervised learning to produce a low-dimensional (typically two-dimensional) view from high-dimensional data. The visualization result is offered to designers in a form of a two-dimensional map, which is called the PSS Business Case Map. By using the map, designers can figure out the position of their current business and can acquire ideas for the servitization of their business.

Sign in / Sign up

Export Citation Format

Share Document