Topological Signal Processing using the Weighted Ordinal Partition Network

• URL: http://arxiv.org/abs/2205.08349v1
• Date: Wed, 27 Apr 2022 18:01:18 GMT
• Title: Topological Signal Processing using the Weighted Ordinal Partition Network
• Authors: Audun Myers, Firas A. Khasawneh, Elizabeth Munch
• Abstract summary: topological data analysis (TDA) encodes information about the shape and structure of data. The idea of utilizing tools from TDA for signal processing tasks, known as topological signal processing (TSP), has gained much attention in recent years. In this paper, we take the next step: building a pipeline to analyze the weighted OPN with TDA.
• Score: 1.9594639581421422
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the most important problems arising in time series analysis is that of bifurcation, or change point detection. That is, given a collection of time series over a varying parameter, when has the structure of the underlying dynamical system changed? For this task, we turn to the field of topological data analysis (TDA), which encodes information about the shape and structure of data. The idea of utilizing tools from TDA for signal processing tasks, known as topological signal processing (TSP), has gained much attention in recent years, largely through a standard pipeline that computes the persistent homology of the point cloud generated by the Takens' embedding. However, this procedure is limited by computation time since the simplicial complex generated in this case is large, but also has a great deal of redundant data. For this reason, we turn to a more recent method for encoding the structure of the attractor, which constructs an ordinal partition network (OPN) representing information about when the dynamical system has passed between certain regions of state space. The result is a weighted graph whose structure encodes information about the underlying attractor. Our previous work began to find ways to package the information of the OPN in a manner that is amenable to TDA; however, that work only used the network structure and did nothing to encode the additional weighting information. In this paper, we take the next step: building a pipeline to analyze the weighted OPN with TDA and showing that this framework provides more resilience to noise or perturbations in the system and improves the accuracy of the dynamic state detection.

Related papers

• Flow reconstruction in time-varying geometries using graph neural networks [1.0485739694839669]
  The model incorporates a feature propagation algorithm as a preprocessing step to handle extremely sparse inputs. A binary indicator is introduced as a validity mask to distinguish between the original and propagated data points. The model is trained on a unique data set of Direct Numerical Simulations (DNS) of a motored engine at a technically relevant operating condition.
  arXiv  Detail & Related papers  (2024-11-13T16:49:56Z)
• Persistent Homology of Coarse Grained State Space Networks [1.7434507809930746]
  We use persistent homology from topological data analysis to study the structure of complex transitional networks. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system.
  arXiv  Detail & Related papers  (2022-05-20T15:29:29Z)
• PERCEPT: a new online change-point detection method using topological data analysis [10.49648038337544]
  Topological data analysis (TDA) provides a set of data analysis tools for extracting embedded topological structures from datasets. We propose a new method, called PERsistence diagram-based ChangE-PoinT detection (PERCEPT), which leverages the learned topological structure to sequentially detect changes.
  arXiv  Detail & Related papers  (2022-03-08T18:05:52Z)
• Bayesian Structure Learning with Generative Flow Networks [85.84396514570373]
  In Bayesian structure learning, we are interested in inferring a distribution over the directed acyclic graph (DAG) from data. Recently, a class of probabilistic models, called Generative Flow Networks (GFlowNets), have been introduced as a general framework for generative modeling. We show that our approach, called DAG-GFlowNet, provides an accurate approximation of the posterior over DAGs.
  arXiv  Detail & Related papers  (2022-02-28T15:53:10Z)
• Space-Time Graph Neural Networks [104.55175325870195]
  We introduce space-time graph neural network (ST-GNN) to jointly process the underlying space-time topology of time-varying network data. Our analysis shows that small variations in the network topology and time evolution of a system does not significantly affect the performance of ST-GNNs.
  arXiv  Detail & Related papers  (2021-10-06T16:08:44Z)
• Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data with Spatial Information [52.635997570873194]
  This work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to process complex multi-dimensional time series data with spatial information. The proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.
  arXiv  Detail & Related papers  (2021-01-12T20:08:18Z)
• Spatio-Temporal Inception Graph Convolutional Networks for Skeleton-Based Action Recognition [126.51241919472356]
  We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition. Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
  arXiv  Detail & Related papers  (2020-11-26T14:43:04Z)
• Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs [54.13919050090926]
  We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph. Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
  arXiv  Detail & Related papers  (2020-05-15T09:17:08Z)
• RobustTAD: Robust Time Series Anomaly Detection via Decomposition and Convolutional Neural Networks [37.16594704493679]
  We propose RobustTAD, a Robust Time series Anomaly Detection framework. It integrates robust seasonal-trend decomposition and convolutional neural network for time series data. It is deployed as a public online service and widely adopted in different business scenarios at Alibaba Group.
  arXiv  Detail & Related papers  (2020-02-21T20:43:45Z)
• Efficient and Stable Graph Scattering Transforms via Pruning [86.76336979318681]
  Graph scattering transforms ( GSTs) offer training-free deep GCN models that extract features from graph data. The price paid by GSTs is exponential complexity in space and time that increases with the number of layers. The present work addresses the complexity limitation of GSTs by introducing an efficient so-termed pruned (p) GST approach.
  arXiv  Detail & Related papers  (2020-01-27T16:05:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.