Skip to content

A Network Science Approach to Granular Time Series Segmentation

May 2025 · arXiv.org · Vol abs/2505.17640 · 0 citations · 69 references
Computer Science Engineering

TL;DR

This work formulate dense univariate segmentation as node classification on a graph whose nodes are the original time points as node classification on a graph whose nodes are the original time points, and evaluates the approach on a TSSB-derived inductive benchmark built from disjoint UCR training and test instances.

Abstract

Time series segmentation assigns a label to each part of a sequence. We formulate dense univariate segmentation as node classification on a graph whose nodes are the original time points. A local window provides node features without setting output granularity. We evaluate the approach on a TSSB-derived inductive benchmark built from disjoint UCR training and test instances. Under one fixed Graph Attention Network (GAT), visibility-based transformations achieve the highest mean ranks among eleven graph constructions. WDPVG, directed NVG, and weighted NVG form a statistically indistinguishable top group after Holm correction. On the 59-dataset Time Series Segmentation Benchmark, WDPVG+GAT reaches a weighted F1 of $0.916$, below seq2point at $0.951$ and statistically indistinguishable from same-feature MLP, random-forest, and 1-NN controls, because at this downsampled resolution each segment is short and the fixed $81$-sample window already spans most of it. At native resolution, where each segment is longer than that window, WDPVG+GAT is less sensitive to feature-window width and remains above the same-feature MLP at every tested window. The graph's advantage over these point-wise classifiers comes from context beyond the local window, which the visibility graph's long-range edges can supply, rather than from better features within it. In a separate resolution sweep, it is statistically tied with a window-searched seq2point while using about $70\times$ fewer parameters and $46\times$ less measured peak memory, although seq2point moves ahead after downsampling. This identifies a practical operating regime for finely sampled series when model size and repeated window tuning matter.

View source

Similar papers

#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Diffusion models as plug-and-play priors

The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.

Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al. · 316 citations · ⚡15

Trajectory Balance: Improved Credit Assignment in GFlowNets

It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...

Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al. · 302 citations · ⚡60
#machine learning Review Open access Jun 2014

Why Early-Stage Software Startups Fail: A Behavioral Framework

This state-of-practice investigation was performed using a literature review followed by a multiple-case study approach and presents how inconsistency between managerial strategies and execution can lead to failure by means of a behavioral framework.

Carmine Giardino, Xiaofeng Wang, P. Abrahamsson · 175 citations · ⚡19
#artificial intelligence Open access Jul 2024

Gender, Race, and Intersectional Bias in Resume Screening via Language Model Retrieval

This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.

Kyra Wilson, Aylin Caliskan · 131 citations · ⚡8
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15

Related blog posts

MIT News · Artificial Intelligence Oct 7, 2026

Discovering the value of humanistic inquiry

Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.

Microsoft Research Blog Oct 7, 2026

Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses

Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.