Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

295988117 · Jun 202019922001200920172026
48 results for time-series segmentation

Preformer improves Transformer for long-term time series forecasting.

problem Transformer's quadratic complexity and lack of context-awareness for long-term forecasting.
method Introduces Multi-Scale Segment-Correlation mechanism for efficient time series segmentation and context-aware attention.
result Preformer outperforms other Transformer-based methods in long-term time series forecasting.

In this paper, we introduce a method for segmenting time series data using tools from Bayesian nonparametrics. We consider the task of temporal segmentation of a set of time series data into representative stationary segments. We use Gaussian process (GP) priors to impose our knowledge about the characteristics of the …

2020-01-27abs ↗pdf ↗

ESPRESSO segments time-series data for better human activity recognition.

problem Segmenting high-dimensional time-series data for applications like HAR.
method ESPRESSO combines entropy and shape analysis for multi-dimensional time-series segmentation.
result ESPRESSO outperforms four state-of-the-art methods across seven datasets.

Within the context of multivariate time series segmentation this paper proposes a method inspired by a posteriori optimal trading. After a normalization step time series are treated channel-wise as surrogate stock prices that can be traded optimally a posteriori in a virtual portfolio holding either stock or cash. Line…

2019-12-16abs ↗pdf ↗

We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of the time series. The process is composed of consecutive patches of variable length, each patch being described by a station…

2010-01-14abs ↗pdf ↗

A new spectrum attention mechanism improves time series classification.

problem Improving robustness and classification accuracy in time series classification.
method Proposes a spectrum attention mechanism (SAM) to filter and highlight important frequency components, using L1 regularization and a tumbling window for segmentation.
result Experimental results show that the proposed SSAM method produces better feature representations and improves classification accuracy.

Piecewise Aggregate Approximation (PAA) is a competitive basic dimension reduction method for high-dimensional time series mining. When deployed, however, the limitations are obvious that some important information will be missed, especially the trend. In this paper, we propose two new approaches for time series that u…

2019-06-28abs ↗pdf ↗

Paper presents a novel time series clustering algorithm for financial inclusion.

problem Difficulty in understanding consumer financial behavior without restrictive credit scoring.
method Developed a novel time series clustering algorithm.
result Allows institutions to offer unique financial products based on customer needs.

New model combines ICA and HMM for unsupervised learning of nonstationary time series.

problem Manual segmentation of non-stationary data is computationally expensive and inaccurate.
method Combines Hidden Markov Model with nonlinear ICA for unsupervised learning.
result Proves identifiability of the model for general mixing nonlinearity.

The accurate and interpretable prediction of future events in time-series data often requires the capturing of representative patterns (or referred to as states) underpinning the observed data. To this end, most existing studies focus on the representation and recognition of states, but ignore the changing transitional…

2019-05-10abs ↗pdf ↗

This work addresses the problem of segmentation in time series data with respect to a statistical parameter of interest in Bayesian models. It is common to assume that the parameters are distinct within each segment. As such, many Bayesian change point detection models do not exploit the segment parameter patterns, whi…

2017-10-26abs ↗pdf ↗

The modeling of time series is becoming increasingly critical in a wide variety of applications. Overall, data evolves by following different patterns, which are generally caused by different user behaviors. Given a time series, we define the evolution gene to capture the latent user behaviors and to describe how the b…

2019-05-10abs ↗pdf ↗

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.

New bounds for causal effect identification in time series graphs with latent confounders.

problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.

We tackle anomaly detection in sparse time series data.

problem Sparse time series with low signal-to-noise ratios and non-uniform performance.
method We introduce a novel generative procedure for benchmark datasets and demonstrate how anomaly score smoothing improves performance.
result Anomaly score smoothing consistently improves performance in low-count time series anomaly detection.

ReWTS ensemble improves time-series forecasting by adapting to changing dynamics.

problem Complex, multi-faceted, evolving data in process industries.
method Chunk-based, recency-weighted temporal segmentation of data for multi-step forecasting.
result Significantly outperforms conventional models in mean squared forecasting error.

This paper compares stationarity in Bitcoin and S&P500 price indices.

problem Comparing stationarity in cryptocurrency and traditional stock market indices.
method Wide sense stationarity defined; Wiener-Khinchin Theorem applied; stationarity achieved through detrending and normalization of price returns.
result S&P500 price return achieves stationarity for 28 years with specific normalization windows, while Bitcoin's stationarity varies by segment and volatility.

A novel approach predicts long-term stock price trends using 2D-convolutional encoders and semantic segmentation.

problem Predicting long-term daily stock price changes with deep learning models.
method Proposes a hierarchical CNN structure with Atrous Spatial Pyramid Pooling blocks to capture both long and short-term temporal relationships.
result Achieved overall accuracy and AUC of 78.18% and 0.88 for predicting trends over the next 20 days.

Bayesian Context Trees improve change-point detection in discrete data.

problem Detecting and segmenting change-points in discrete time series data.
method Bayesian Context Trees framework, Markov chain Monte Carlo sampling.
result Effective sampling from posterior distribution of change-points.

We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conv…

2016-02-20abs ↗pdf ↗

Assessing world-wide financial integration constitutes a recurrent challenge in macroeconometrics, often addressed by visual inspections searching for data patterns. Econophysics literature enables us to build complementary, data-driven measures of financial integration using graphs. The present contribution investigat…

2019-05-28abs ↗pdf ↗

We present a convex approach to probabilistic segmentation and modeling of time series data. Our approach builds upon recent advances in multivariate total variation regularization, and seeks to learn a separate set of parameters for the distribution over the observations at each time point, but with an additional pena…

2015-11-16abs ↗pdf ↗

A methodology is developed to identify, as units of study, each decrease in the value of a stock from a given maximum price level. A critical level in the amount of price declines is found to separate a segment operating under a random walk from a segment operating under a power law. This level is interpreted as a poin…

2016-04-13abs ↗pdf ↗

Proposes a new model for time series that considers smooth transitions between states.

problem Models assume instantaneous transitions between discrete states, ignoring gradual changes.
method Dynamical Wasserstein Barycentric (DWB) model that estimates system state and pure state distributions over time.
result Accurately learns pure state distributions and improves state estimation for transition periods.

Proposes a method for forecasting large-scale interval-valued time series.

problem Modeling and forecasting large-scale interval-valued time series.
method Feature extraction procedure involving auto-segmentation, clustering, and precision matrix estimation.
result The method enhances forecasting performance for large-scale interval-valued time series.

New RDPC dissimilarity measure improves time series clustering.

problem Improving time series clustering methods for diverse data.
method Combining weighted Pearson correlation with largest element-wise differences.
result RDPC outperforms existing methods in complex datasets.

Seglearn is an open-source python package for machine learning time series or sequences using a sliding window segmentation approach. The implementation provides a flexible pipeline for tackling classification, regression, and forecasting problems with multivariate sequence and contextual data. This package is compatib…

2018-03-21abs ↗pdf ↗