Proposes a new method to extract time-aware shapelets for better time series modeling.
problem Challenges in achieving reliable efficiency and interpretability in time series modeling.
method Designs a two-level timing factor to extract time-aware shapelets and constructs a shapelet evolution graph.
result Improves time series modeling by extracting time-aware shapelets and incorporating them into embeddings.
Shapelet is a discriminative subsequence of time series. An advanced shapelet-based method is to embed shapelet into accurate and fast random forest. However, it shows several limitations. First, random shapelet forest requires a large training cost for split threshold searching. Second, a single shapelet provides limi…
A new algorithm reduces time complexity for binary time series classification.
problem High time complexity of ensemble shapelet transform limits its application.
method Introduces short isometric shapelet transform with two strategies: fixed shapelet length and single linear classifier.
result Demonstrates superior performance and reduced time complexity.
In the time series classification domain, shapelets are small time series that are discriminative for a certain class. It has been shown that classifiers are able to achieve state-of-the-art results on a plethora of datasets by taking as input distances from the input time series to different discriminative shapelets. …
We propose a new formulation of Multiple-Instance Learning (MIL). In typical MIL settings, a unit of data is given as a set of instances called a bag and the goal is to find a good classifier of bags based on similarity from a single or finitely many "shapelets" (or patterns), where the similarity of the bag from a sha…
New formulation of MIL using shapelets for better classifier of bags.
problem Finding a good classifier of bags based on shapelets.
method Formulation using all possible shapelets, reduced to DC programs, and heuristic options.
result Richer class of classifiers with theoretical justification and empirical validation.
Times series classification can be successfully tackled by jointly learning a shapelet-based representation of the series in the dataset and classifying the series according to this representation. However, although the learned shapelets are discriminative, they are not always similar to pieces of a real series in the …
Extends shapelet transform to irregular time series, improving interpretability and efficiency.
problem Limitations of shapelet transform for irregular, partially observed time series.
method Continuous-time formulation, regularisation penalty, learned pseudometric.
result Efficient training without sacrificing interpretability for irregular, partially observed time series.
Method summarizes and predicts time series data for COVID-19 cases and deaths.
problem Summarizing and predicting time series data for multiple related time series.
method Hierarchical algorithm generating shapelets for centroids, nearest neighbor search for labeling, dynamic time warping for non-uniform lengths.
result Predictive model for individual time series based on aggregated statistics.
Interpretable neural model for few-shot time-series classification.
problem Few-shot time-series classification challenges.
method Dual Prototypical Shapelet Networks (DPSN) framework.
result DPSN framework outperforms state-of-the-art methods, especially with limited data.
Shapelet transform improves time series classification for earthquake, wind, and wave events.
problem Autonomous detection of specific events from large time series datasets in civil engineering.
method Shapelet transform for local similarity in time series subsequences, combined with machine learning.
result Shapelet transform yields a new feature representation for time series signals in civil engineering.
New algorithm for uncertain time series classification.
problem Uncertainty in time series data.
method Uncertain dissimilarity measure based on Euclidean distance and uncertain shapelet transform.
result Effectiveness of the uncertain shapelet transform algorithm on state-of-the-art datasets.
RTFN extracts robust temporal features for time series analysis.
problem Challenges in extracting sufficient shapelets from time series data.
method Combines temporal feature networks and attentional LSTM networks.
result RTFN outperforms in supervised and unsupervised time series analysis.
New algorithms benchmarked for multivariate time series classification.
problem Comparing algorithms for multivariate time series classification.
method Review and comparison of recent MTSC algorithms using the UEA archive.
result HIVE-COTE ensemble is most accurate for MTSC, but dynamic time warping is competitive.
Pattern sampling reduces time series classification complexity.
problem High computational complexity of exhaustive search for shapelets.
method Pattern sampling using a weighted trie to extract discriminative patterns.
result Significant reduction in computational and memory resources.
SigTime learns interpretable signatures from time series data.
problem Discovering meaningful patterns in time series data with high complexity and limited interpretability.
method Jointly trains two Transformer models using shapelet-based and feature engineering representations.
result Learned shapelets serve as interpretable signatures for time series classification.
EQShapelets detect earthquakes with high accuracy and interpretability.
problem Automated detection and cataloging of earthquakes.
method Time-series shape-based approach embedded in machine learning.
result EQShapelets detected all cataloged and 281 uncataloged events with lower false detection rate.
UniShape improves time series classification by selecting relevant subsequences.
problem Classifying time series data requires capturing interpretable shapelets.
method UniShape uses a shape-aware adapter to aggregate multiscale subsequences into class tokens.
result UniShape achieves state-of-the-art classification performance.
Co-eye combines multiple symbolic representations to improve time series classification accuracy.
problem Challenges in time series classification due to domain diversity.
method Inspired by compound eyes, Co-eye uses multiple symbolic representations and hyper-parameterised lenses to classify time series data.
result Co-eye outperforms state-of-the-art techniques in accuracy and robustness across various domains.
Time series classification has received great attention over the past decade with a wide range of methods focusing on predictive performance by exploiting various types of temporal features. Nonetheless, little emphasis has been placed on interpretability and explainability. In this paper, we formulate the novel proble…
This paper reviews early time series classification methods.
problem Minimizing class prediction delay in time-sensitive applications.
method Divided into four categories: prefix based, shapelet based, model based, and miscellaneous approaches.
result Demonstrates reasonable performance in various applications.
The last decade has seen a flurry of research on all-pairs-similarity-search (or, self-join) for text, DNA, and a handful of other datatypes, and these systems have been applied to many diverse data mining problems. Surprisingly, however, little progress has been made on addressing this problem for time series subseque…
A family of algorithms for time series classification (TSC) involve running a sliding window across each series, discretising the window to form a word, forming a histogram of word counts over the dictionary, then constructing a classifier on the histograms. A recent evaluation of two of this type of algorithm, Bag of …
Paper shows leafwise cohomological expression for dynamical zeta functions.
problem Analyzing dynamical zeta functions on foliated dynamical systems.
method Leafwise cohomological approach.
result Leafwise cohomological expression of dynamical zeta functions.
Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.
problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.
The paper studies dynamic star-shaped risk measures and their representation.
problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.
Study circles to understand dynamics and rigidity in homogeneous spaces.
problem Understanding dynamics and rigidity in infinite-volume homogeneous spaces.
method Addressing four questions about circle packings.
result Highlighting the interplay between dynamics, geometry, and rigidity.
Paper connects dynamics of mechanical systems to Reeb dynamics.
problem Understanding dynamics in mechanical systems with Poisson structures.
method Using Jacobi bundle metrics and linear Poisson structures.
result Extends classical results on Reeb dynamics to mechanical systems.
Two heuristics solve dynamic multiple travelling salesmen problems.
problem Dynamic routing with unknown customers.
method Balanced dynamic closest vehicle heuristic and balanced dynamic assignment vehicle heuristic.
result Continuous approximation models for strategic dynamic routing.
In this paper we present a theoretical framework for studying coherent acceptability indices in a dynamic setup. We study dynamic coherent acceptability indices and dynamic coherent risk measures, and we establish a duality between them. We derive a representation theorem for dynamic coherent risk measures in terms of …
DOODL learns shared spectral dynamics across related dynamical systems.
problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.
We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…
SPICE estimates sparse linear dynamic networks without hyperparameters.
problem Estimating topology and dynamics of sparse linear dynamic networks.
method SPICE (Sparse Iterative Covariance Estimation) method in an iterative framework.
result Directly reveals the underlying topology of the network.
In this paper we present a theoretical framework for determining dynamic ask and bid prices of derivatives using the theory of dynamic coherent acceptability indices in discrete time. We prove a version of the First Fundamental Theorem of Asset Pricing using the dynamic coherent risk measures. We introduce the dynamic …
Dynamical-VAE learns causal dynamics from POMDPs using future information.
problem Learning accurate state representations from partial observations in POMDPs.
method Dynamical Variational Auto-Encoder (DVAE) with hindsight framework.
result DVAE uncovers causal graph more effectively than history-based methods.
Most real world phenomena such as sunlight distribution under a forest canopy, minerals concentration, stock valuation, exhibit nonstationary dynamics i.e. phenomenon variation changes depending on the locality. Nonstationary dynamics pose both theoretical and practical challenges to statistical machine learning algori…
Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.
problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.
Method learns to map dynamics of different systems.
problem Mapping dynamics of different systems.
method Learned latent dynamical system for mapping.
result Learned correspondences enable imagined motions and bisimulation.
dLDS models neural dynamics as sparse combinations of simpler components.
problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.
Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…
We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…
Framework for quantifying uncertainty in dynamic processes.
problem Quantifying uncertainty in dynamic stochastic processes.
method Define dynamic uncertainty sets and dynamic robust risk measures.
result Dynamic robust risk measures are time-consistent under specific uncertainty sets.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
Framework infers Langevin dynamics from stochastic observations of latent systems.
problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.
The paper introduces a dynamic MVP model using high-frequency financial data.
problem Capturing the dynamics of minimum variance portfolio weights in financial markets.
method Imposes autoregressive structure on MVP processes and uses CLIME and LASSO for estimation.
result Proposes DR-MVP model with established asymptotic properties.
The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.
problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.
NDS learns dynamical models with prior knowledge, improving accuracy and efficiency.
problem Learning accurate dynamical models with limited data and varying dynamics.
method Neural Dynamical Systems (NDS) integrates prior knowledge in ODEs with neural networks to estimate parameters and predict states.
result NDS achieves higher accuracy and uses fewer samples compared to other methods.
New method learns population dynamics from snapshots, outperforming existing models.
problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.