Inferensys

Glossary

Change Point Detection

The algorithmic identification of abrupt shifts in the statistical properties of a sensor stream, signaling a transition to a new degradation phase.
Security analyst reviewing fraud detection AI on multiple screens, alert dashboards visible, dark mode monitoring setup.
STATISTICAL PROCESS CONTROL

What is Change Point Detection?

Change point detection is the algorithmic identification of abrupt shifts in the statistical properties of a time-series data stream, signaling a transition from one operational regime to another.

Change point detection is a sequential analysis technique that identifies the precise moments when the underlying probability distribution of a streaming sensor variable changes. Unlike simple thresholding, these algorithms distinguish between random noise and a genuine structural break in the mean, variance, or frequency spectrum of the data, marking the exact index where a machine transitions from a healthy state to a degraded one.

In predictive maintenance, these methods are critical for segmenting a continuous sensor stream into distinct degradation phases without prior knowledge of failure signatures. By applying techniques like the Pruned Exact Linear Time (PELT) algorithm or Bayesian online change point detection, systems can autonomously detect the onset of a new wear regime, triggering a recalibration of the Remaining Useful Life (RUL) model before catastrophic failure occurs.

STATISTICAL PHASE TRANSITIONS

Core Characteristics of Change Point Detection

Change point detection algorithms identify the precise moments when the statistical properties of a sensor stream shift, signaling a transition from normal operation to a new degradation phase.

01

Sequential Probability Ratio Testing

A foundational online detection method that continuously evaluates the likelihood ratio between two hypotheses: no change versus a change has occurred. The algorithm accumulates evidence from each new sensor reading and triggers an alert when the cumulative sum exceeds a predefined threshold. This approach minimizes the average detection delay for a given false alarm rate, making it ideal for high-velocity streaming telemetry where immediate phase transition awareness is critical.

Sub-second
Typical Detection Latency
02

Bayesian Change Point Analysis

A probabilistic framework that computes the posterior distribution over run lengths—the time since the last change point—given observed data. Rather than a single point estimate, this method maintains a distribution of possible change locations, updating beliefs recursively with each new observation. Key advantages include:

  • Natural uncertainty quantification around detected shifts
  • Ability to incorporate prior domain knowledge about expected degradation rates
  • Robust performance on noisy industrial sensor streams where hard thresholds fail
Full posterior
Uncertainty Representation
03

CUSUM Algorithm

The Cumulative Sum control chart tracks the accumulated deviation of a process from a target value. When the monitored parameter shifts—such as a sudden increase in bearing vibration amplitude—the CUSUM statistic drifts upward linearly, crossing a decision boundary far faster than Shewhart charts. The algorithm is optimal for detecting sustained mean shifts and is widely deployed in manufacturing for:

  • Tool wear monitoring in CNC machining
  • Detecting step changes in motor current signatures
  • Identifying persistent thermal runaway precursors
~50% faster
Detection vs. Shewhart Charts
04

Pruned Exact Linear Time (PELT)

An offline algorithm that finds the exact optimal segmentation of a time series into homogeneous segments while operating in linear time under mild conditions. PELT uses dynamic programming with a pruning rule that discards candidate change points that can never be optimal, dramatically reducing computational cost. This method excels at retrospective analysis of historical run-to-failure datasets, enabling precise labeling of degradation phase boundaries for training supervised Remaining Useful Life models.

O(n)
Computational Complexity
05

Kernel Change Point Detection

A non-parametric method that maps sensor data into a reproducing kernel Hilbert space and detects distributional changes using the maximum mean discrepancy statistic. This approach can identify subtle shifts in the entire probability distribution—not just the mean or variance—making it powerful for catching complex degradation patterns like changes in signal kurtosis or spectral shape. It operates without assuming any underlying parametric model, providing robustness across diverse equipment types and failure modes.

Distribution-wide
Detection Scope
06

Binary Segmentation

A computationally efficient divide-and-conquer strategy that repeatedly applies a single change point test to sub-segments of the time series. The algorithm first locates the most significant change point globally, then recursively searches the left and right partitions for additional shifts. While greedy and approximate, binary segmentation scales well to extremely long sensor logs and serves as a practical baseline for identifying multiple degradation stage transitions in high-frequency vibration data.

O(n log n)
Typical Runtime
CHANGE POINT DETECTION

Frequently Asked Questions

Clear, technical answers to the most common questions about identifying abrupt statistical shifts in industrial sensor streams for predictive maintenance.

Change point detection is the algorithmic identification of abrupt shifts in the statistical properties of a time-series data stream, signaling a transition from one operational or degradation state to another. Unlike gradual trend analysis, it pinpoints the exact moment—or narrow window—where the mean, variance, or frequency distribution of a sensor signal changes irreversibly. The core mechanism involves running a cost function over sequential data windows to measure homogeneity; when a new observation significantly increases the cumulative cost, the algorithm flags a change point. Common approaches include Pruned Exact Linear Time (PELT) for optimal offline segmentation and Bayesian Online Change Point Detection (BOCPD) for real-time streaming scenarios. In predictive maintenance, a detected change point often marks the transition from healthy operation to an incipient fault phase, triggering an immediate inspection alert before catastrophic failure occurs.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.