SearcharxivSearch

arXiv subjects

Piyanon Charoenpoonpanich

Publications and source records attributed to Piyanon Charoenpoonpanich.

3 recordsLinked to original sources

LGTD: Local-Global Trend Decomposition for Season-Length-Free Time Series Analysis

Time series decomposition into trend, seasonal, and residual components is a fundamental primitive in data mining and analytics pipelines, underpinning anomaly detection, change-point analysis, and forecasting. Most existing methods require a user-specified or estimated season length and assume stable periodic structure. In large, heterogeneous collections, where recurring patterns drift, appear intermittently, or operate at multiple nonstationary scales, period selection becomes brittle and per-series tuning does not scale. We propose LGTD (Local-Global Trend Decomposition), a season-length-free decomposition framework that requires no period specification and operates with a single fixed default configuration across datasets. LGTD represents a series as the sum of (i) a smooth global trend capturing long-term evolution, (ii) adaptive local trends inferred by an error-driven local linear segmentation procedure, and (iii) a residual component. Rather than modeling seasonality through an explicit periodic basis, LGTD treats it as an emergent property arising from the recurrence of local trend regimes, decoupling decomposition quality from any estimated season length. We prove that the local trend inference procedure terminates in a bounded number of iterations and runs in linear time in the series length, independent of any seasonal parameter, and confirm this empirically: LGTD scales linearly in runtime and memory and is the fastest method across all tested lengths, while several baselines degrade super-linearly. On synthetic benchmarks LGTD achieves balanced accuracy across fixed, transitive, and variable season-length regimes, particularly where period-based methods degrade, and on real-world data it yields interpretable components and low-structure residuals. Source code and datasets are available at https://github.com/chotanansub/LGTD.

cs.DB

Reduced Efficiency in the Attentional Network During Distractor Suppression in Mild Cognitive Impairment

Mild Cognitive Impairment (MCI) is a critical transitional stage between normal cognitive aging and dementia, making its early detection essential. This study investigates the neural mechanisms of distractor suppression in MCI patients using EEG and behavioral data during an attention-cueing Eriksen flanker task. A cohort of 56 MCIs and 26 healthy controls (HCs) performed tasks with congruent and incongruent stimuli of varying saliency levels. During these tasks, EEG data were analyzed for alpha band coherence's functional connectivity, focusing on Global Efficiency (GE), while Reaction Time (RT) and Hit Rate (HR) were also collected. Our findings reveal significant interactions between congruency, saliency, and cognitive status on GE, RT, and HR. In HCs, congruent conditions resulted in higher GE (p = 0.0114, multivariate t-distribution correction, MVT), faster RTs (p < 0.0001, MVT), and higher HRs (p < 0.0001, MVT) compared to incongruent conditions. HCs also showed increased GE in salient conditions for incongruent trials (p = 0.0406, MVT). MCIs exhibited benefits from congruent conditions with shorter RTs and higher HRs (both p < 0.0001, MVT) compared to incongruent conditions but showed reduced adaptability in GE, with no significant GE differences between conditions. These results highlight the potential of alpha band coherence and GE as early markers for cognitive impairment. By integrating GE, RT, and HR, this study provides insights into the interplay between neural efficiency, processing speed, and task accuracy. This approach offers valuable insights into cognitive load management and interference effects, indicating benefits for interventions aimed at improving attentional control and processing speed in MCIs.

q-bio.NC

Inferring the Most Similar Variable-length Subsequences between Multidimensional Time Series

Finding the most similar subsequences between two multidimensional time series has many applications: e.g. capturing dependency in stock market or discovering coordinated movement of baboons. Considering one pattern occurring in one time series, we might be wondering whether the same pattern occurs in another time series with some distortion that might have a different length. Nevertheless, to the best of our knowledge, there is no efficient framework that deals with this problem yet. In this work, we propose an algorithm that provides the exact solution of finding the most similar multidimensional subsequences between time series where there is a difference in length both between time series and between subsequences. The algorithm is built based on theoretical guarantee of correctness and efficiency. The result in simulation datasets illustrated that our approach not just only provided correct solution, but it also utilized running time only quarter of time compared against the baseline approaches. In real-world datasets, it extracted the most similar subsequences even faster (up to 20 times faster against baseline methods) and provided insights regarding the situation in stock market and following relations of multidimensional time series of baboon movement. Our approach can be used for any time series. The code and datasets of this work are provided for the public use.

cs.LG