Discriminant Dynamic Mode Decomposition for Labeled Spatio-Temporal Data Collections

• URL: http://arxiv.org/abs/2102.09973v1
• Date: Fri, 19 Feb 2021 15:12:59 GMT
• Title: Discriminant Dynamic Mode Decomposition for Labeled Spatio-Temporal Data Collections
• Authors: Naoya Takeishi, Keisuke Fujii, Koh Takeuchi, Yoshinobu Kawahara
• Abstract summary: We propose a new method for extracting coherent patterns from labeled-temporal data collections. We achieve such pattern extraction by incorporating discriminant analysis into Dynamic mode decomposition. We illustrate our method using a synthetic dataset and several real-world datasets.
• Score: 16.69145658813375
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Extracting coherent patterns is one of the standard approaches towards understanding spatio-temporal data. Dynamic mode decomposition (DMD) is a powerful tool for extracting coherent patterns, but the original DMD and most of its variants do not consider label information, which is often available as side information of spatio-temporal data. In this work, we propose a new method for extracting distinctive coherent patterns from labeled spatio-temporal data collections, such that they contribute to major differences in a labeled set of dynamics. We achieve such pattern extraction by incorporating discriminant analysis into DMD. To this end, we define a kernel function on subspaces spanned by sets of dynamic modes and develop an objective to take both reconstruction goodness as DMD and class-separation goodness as discriminant analysis into account. We illustrate our method using a synthetic dataset and several real-world datasets. The proposed method can be a useful tool for exploratory data analysis for understanding spatio-temporal data.

Related papers

• Parsimonious Dynamic Mode Decomposition: A Robust and Automated Approach for Optimally Sparse Mode Selection in Complex Systems [0.40964539027092917]
  This paper introduces the Parsimonious Dynamic Mode Decomposition (parsDMD) ParsDMD is a novel algorithm designed to automatically select an optimally sparse subset of dynamic modes for both temporal and purely temporal data. It is validated on a diverse range of datasets, including standing wave signals, identifying hidden dynamics, fluid dynamics simulations, and atmospheric sea-surface temperature (SST) data.
  arXiv  Detail & Related papers  (2024-10-22T03:00:11Z)
• Towards a Theoretical Understanding of Memorization in Diffusion Models [76.85077961718875]
  Diffusion probabilistic models (DPMs) are being employed as mainstream models for Generative Artificial Intelligence (GenAI) We provide a theoretical understanding of memorization in both conditional and unconditional DPMs under the assumption of model convergence. We propose a novel data extraction method named textbfSurrogate condItional Data Extraction (SIDE) that leverages a time-dependent classifier trained on the generated data as a surrogate condition to extract training data from unconditional DPMs.
  arXiv  Detail & Related papers  (2024-10-03T13:17:06Z)
• Entropic Regression DMD (ERDMD) Discovers Informative Sparse and Nonuniformly Time Delayed Models [0.0]
  We present a method which determines optimal multi-step dynamic mode decomposition models via entropic regression. We develop a method that produces high fidelity time-delay DMD models that allow for nonuniform time space. These models are shown to be highly efficient and robust.
  arXiv  Detail & Related papers  (2024-06-17T20:02:43Z)
• Dynamic Mode Decomposition for data-driven analysis and reduced-order modelling of ExB plasmas: I. Extraction of spatiotemporally coherent patterns [3.203036813451742]
  We evaluate the generalability of the Dynamic Mode Decomposition (DMD) algorithm for data-driven analysis and reduced-order modelling of plasma dynamics.
  arXiv  Detail & Related papers  (2023-08-26T01:37:52Z)
• Disentanglement via Latent Quantization [60.37109712033694]
  In this work, we construct an inductive bias towards encoding to and decoding from an organized latent space. We demonstrate the broad applicability of this approach by adding it to both basic data-re (vanilla autoencoder) and latent-reconstructing (InfoGAN) generative models.
  arXiv  Detail & Related papers  (2023-05-28T06:30:29Z)
• Dynamic Latent Separation for Deep Learning [67.62190501599176]
  A core problem in machine learning is to learn expressive latent variables for model prediction on complex data. Here, we develop an approach that improves expressiveness, provides partial interpretation, and is not restricted to specific applications.
  arXiv  Detail & Related papers  (2022-10-07T17:56:53Z)
• Learning from Temporal Spatial Cubism for Cross-Dataset Skeleton-based Action Recognition [88.34182299496074]
  Action labels are only available on a source dataset, but unavailable on a target dataset in the training stage. We utilize a self-supervision scheme to reduce the domain shift between two skeleton-based action datasets. By segmenting and permuting temporal segments or human body parts, we design two self-supervised learning classification tasks.
  arXiv  Detail & Related papers  (2022-07-17T07:05:39Z)
• Dynamic Mode Decomposition in Adaptive Mesh Refinement and Coarsening Simulations [58.720142291102135]
  Dynamic Mode Decomposition (DMD) is a powerful data-driven method used to extract coherent schemes. This paper proposes a strategy to enable DMD to extract from observations with different mesh topologies and dimensions.
  arXiv  Detail & Related papers  (2021-04-28T22:14:25Z)
• Towards an Adaptive Dynamic Mode Decomposition [0.0]
  Dynamic Mode Decomposition (DMD) is a data based modeling tool that identifies a matrix to map a quantity at some time instant to the same quantity in future. We design a new version which we call Adaptive Dynamic Mode Decomposition (ADMD) that utilizes time delay coordinates, projection methods and filters as per the nature of the data to create a model for the available problem.
  arXiv  Detail & Related papers  (2020-12-11T22:50:09Z)
• Learning Stochastic Behaviour from Aggregate Data [52.012857267317784]
  Learning nonlinear dynamics from aggregate data is a challenging problem because the full trajectory of each individual is not available. We propose a novel method using the weak form of Fokker Planck Equation (FPE) to describe the density evolution of data in a sampled form. In such a sample-based framework we are able to learn the nonlinear dynamics from aggregate data without explicitly solving the partial differential equation (PDE) FPE.
  arXiv  Detail & Related papers  (2020-02-10T03:20:13Z)

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.