Analysis of alcoholic EEG signals based on horizontal visibility graph entropy.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhu G
PROVIDER: S-EPMC4883153 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.
| S-EPMC4646626 | biostudies-literature
Project description:A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque et al., Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa et al., Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the distinction between deterministic and stochastic components in time series [L. Lacasa and R. Toral, Phys. Rev. E., 82, 036120 (2010)]. Specifically, the authors propose that the node degree distribution of these processes follows an exponential functional of the form [Formula: see text], in which [Formula: see text] is the node degree and [Formula: see text] is a positive parameter able to distinguish between deterministic (chaotic) and stochastic (uncorrelated and correlated) dynamics. In this work, we investigate the characteristics of the node degree distributions constructed by using HVG, for time series corresponding to [Formula: see text] chaotic maps, 2 chaotic flows and [Formula: see text] different stochastic processes. We thoroughly study the methodology proposed by Lacasa and Toral finding several cases for which their hypothesis is not valid. We propose a methodology that uses the HVG together with Information Theory quantifiers. An extensive and careful analysis of the node degree distributions obtained by applying HVG allow us to conclude that the Fisher-Shannon information plane is a remarkable tool able to graphically represent the different nature, deterministic or stochastic, of the systems under study.
| S-EPMC4172653 | biostudies-literature
Project description:Detection, characterization and classification of patterns within time series from electrophysiological signals have been a challenge for neuroscientists due to their complexity and variability. Here, we aimed to use graph theory to characterize and classify waveforms within biological signals using maxcliques as a feature for a deep learning method. We implemented a compact and easy to visualize algorithm and interface in Python. This software uses time series as input. We applied the maxclique graph operator in order to obtain further graph parameters. We extracted features of the time series by processing all graph parameters through K-means, one of the simplest unsupervised machine learning algorithms. As proof of principle, we analyzed integrated electrical activity of XII nerve to identify waveforms. Our results show that the use of maxcliques allows identification of two distinct types of waveforms that match expert classification. We propose that our method can be a useful tool to characterize and classify other electrophysiological signals in a short time and objectively. Reducing the classification time improves efficiency for further analysis in order to compare between treatments or conditions, e.g., pharmacological trials, injuries, or neurodegenerative diseases.
| S-EPMC7174547 | biostudies-literature
Project description:One of the fundamental open questions in plasma physics is the role of non-thermal particles distributions in poorly collisional plasma environments, a system that is commonly found throughout the Universe, e.g., the solar wind and the Earth's magnetosphere correspond to natural plasma physics laboratories in which turbulent phenomena can be studied. Our study perspective is born from the method of Horizontal Visibility Graph (HVG) that has been developed in the last years to analyze time series avoiding the tedium and the high computational cost that other methods offer. Here, we build a complex network based on directed HVG technique applied to magnetic field fluctuations time series obtained from Particle In Cell (PIC) simulations of a magnetized collisionless plasma to distinguish the degree distributions and calculate the Kullback-Leibler Divergence (KLD) as a measure of relative entropy of data sets produced by processes that are not in equilibrium. First, we analyze the connectivity probability distribution for the undirected version of HVG finding how the Kappa distribution for low values of κ tends to be an uncorrelated time series, while the Maxwell-Boltzmann distribution shows a correlated stochastic processes behavior. Subsequently, we investigate the degree of temporary irreversibility of magnetic fluctuations that are self-generated by the plasma, comparing the case of a thermal plasma (described by a Maxwell-Botzmann velocity distribution function) with non-thermal Kappa distributions. We have shown that the KLD associated to the HVG is able to distinguish the level of reversibility that is associated to the thermal equilibrium in the plasma, because the dissipative degree of the system increases as the value of κ parameter decreases and the distribution function departs from the Maxwell-Boltzmann equilibrium.
| S-EPMC8073191 | biostudies-literature
Project description:The limited penetrable horizontal visibility algorithm is an analysis tool that maps time series into complex networks and is a further development of the horizontal visibility algorithm. This paper presents exact results on the topological properties of the limited penetrable horizontal visibility graph associated with independent and identically distributed (i:i:d:) random series. We show that the i.i.d: random series maps on a limited penetrable horizontal visibility graph with exponential degree distribution, independent of the probability distribution from which the series was generated. We deduce the exact expressions of mean degree and clustering coefficient, demonstrate the long distance visibility property of the graph and perform numerical simulations to test the accuracy of our theoretical results. We then use the algorithm in several deterministic chaotic series, such as the logistic map, H´enon map, Lorenz system, energy price chaotic system and the real crude oil price. Our results show that the limited penetrable horizontal visibility algorithm is efficient to discriminate chaos from uncorrelated randomness and is able to measure the global evolution characteristics of the real time series.
| S-EPMC5865175 | biostudies-other
Project description:Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.
| S-EPMC4271566 | biostudies-literature
Project description:Entropy measures that assess signals' complexity have drawn increasing attention recently in biomedical field, as they have shown the ability of capturing unique features that are intrinsic and physiologically meaningful. In this study, we applied entropy analysis to electroencephalogram (EEG) data to examine its performance in epilepsy detection based on short-term EEG, aiming at establishing a short-term analysis protocol with optimal seizure detection performance. Two classification problems were considered, i.e., 1) classifying interictal and ictal EEGs (epileptic group) from normal EEGs; and 2) classifying ictal from interictal EEGs. For each problem, we explored two protocols to analyze the entropy of EEG: i) using a single analytical window with different window lengths, and ii) using an average of multiple windows for each window length. Two entropy methods-fuzzy entropy (FuzzyEn) and distribution entropy (DistEn)-were used that have valid outputs for any given data lengths. We performed feature selection and trained classifiers based on a cross-validation process. The results show that performance of FuzzyEn and DistEn may complement each other and the best performance can be achieved by combining: 1) FuzzyEn of one 5-s window and the averaged DistEn of five 1-s windows for classifying normal from epileptic group (accuracy: 0.93, sensitivity: 0.91, specificity: 0.96); and 2) the averaged FuzzyEn of five 1-s windows and DistEn of one 5-s window for classifying ictal from interictal EEGs (accuracy: 0.91, sensitivity: 0.93, specificity: 0.90). Further studies are warranted to examine whether this proposed short-term analysis procedure can help track the epileptic activities in real time and provide prompt feedback for clinical practices.
| S-EPMC5854404 | biostudies-literature
Project description:Ganzfeld conditions induce alterations in brain function and pseudo-hallucinatory experiences, particularly in people with high positive schizotypy. The current study uses graph-based parameters to investigate and classify brain networks under Ganzfeld conditions as a function of positive schizotypy. Participants from the general population (14 high schizotypy (HS), 29 low schizotypy (LS)) had an electroencephalography assessment during Ganzfeld conditions, with varying visual activation (8 frequencies of random light flicker) and soundscape-induced mood (neutral, serenity, and anxiety). Weighted functional networks were computed in six frequency sub-bands (delta, theta, alpha-low, alpha-high, beta, and gamma) as a function of light-flicker frequency and mood. The brain network was analyzed using graph theory parameters, including clustering coefficient (CC), strength, and global efficiency (GE). It was found that the LS groups had higher CC and strength than the HS groups, especially in bilateral temporal and frontotemporal brain regions. Moreover, some decreases in CC and strength measures were found in LS groups among occipital and parieto-occipital brain regions. LS groups also had significantly higher GE in all Ganzfeld conditions compared to the HS groups. The random under-sampling boosting (RUSBoost) algorithm achieved the best classification performance with an accuracy of 95.34%, specificity of 96.55%, and sensitivity of 92.85% during an anxiety-induction Ganzfeld condition. This is the first exploration of the relationship between brain functional state changes under Ganzfeld conditions in individuals who vary in positive schizotypy. The accuracy of graph-based parameters in classifying brain states as a function of schizotypy is shown, particularly for brain activity during anxiety induction, and should be investigated in psychosis.
| S-EPMC10514040 | biostudies-literature
Project description:Several methods to quantify the complexity of a time series have been proposed in the literature, which can be classified into three categories: structure/self-affinity, attractor in the phase space, and randomness. In 2009, Lacasa et al. proposed a new method for characterizing a time series called the natural visibility algorithm, which maps the data into a network. To further investigate the capabilities of this technique, in this work, we analyzed the monthly ambient temperature of 4 cities located in different climatic zones on the Peninsula of Yucatan, Mexico, using detrended fluctuation analysis (structure complexity), approximate entropy (randomness complexity) and the network approach. It was found that by measuring the complexity of the dynamics by structure or randomness, the magnitude was very similar between the cities in different climatic zones; however, by analyzing topological indices such as Laplacian energy and Shannon entropy to characterize networks, we found differences between those cities. With these results, we show that analysis using networks has considerable potential as a fourth way to quantify complexity and that it may be applied to more subtle complex systems such as physiological signals and their high impact on early warnings.
| S-EPMC6922406 | biostudies-literature
Project description:The world has faced a coronavirus outbreak, which, in addition to lung complications, has caused other serious problems, including cardiovascular. There is still no explanation for the mechanisms of coronavirus that trigger dysfunction of the cardiac autonomic nervous system (ANS). We believe that the complex mechanisms that change the status of ANS could only be solved by advanced multidimensional analysis of many variables, obtained both from the original cardiovascular signals and from laboratory analysis and detailed patient history. The aim of this paper is to analyze different measures of entropy as potential dimensions of the multidimensional space of cardiovascular data. The measures were applied to heart rate and systolic blood pressure signals collected from 116 patients with COVID-19 and 77 healthy controls. Methods that indicate a statistically significant difference between patients with different levels of infection and healthy controls will be used for further multivariate research. As a result, it was shown that a statistically significant difference between healthy controls and patients with COVID-19 was shown by sample entropy applied to integrated transformed probability signals, common symbolic dynamics entropy, and copula parameters. Statistical significance between serious and mild patients with COVID-19 can only be achieved by cross-entropies of heart rate signals and systolic pressure. This result contributes to the hypothesis that the severity of COVID-19 disease is associated with ANS disorder and encourages further research.
| S-EPMC7826611 | biostudies-literature