Find level shifts in a series with two-sided CUSUM alarms and a mean-shift binar...

{ "method": "GET", "queryParams": { "method": "binseg", "values": "1,1,1,1,1,5,5,5,5,5" }, "type": "http" }

{ "example": { "asOf": "2026-10-21T06:18:22.158Z", "binarySegmentation": { "acceptThreshold": 0, "changePoints": [ { "newLevelStartsAtPosition": 6, "sseReduction": 40 } ], "noiseSigma": 0, "segments": [ { "from": 1, "mean": 1, "to": 5 }, { "from": 6, "mean": 5, "to": 10 } ] }, "degraded": false, "disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.", "method": "binseg", "n": 10, "notChecked": [ "changes in variance or slope (only mean shifts are searched)", "a formal significance test or false-alarm rate", "…1 more" ], "reasons": [ "Binary segmentation: repeatedly split where the sum of squared errors drops most; a split is kept if the drop exceeds 2 x noiseSigma^2 x ln(n), with noiseSigma from the median absolute successive diff…" ], "source": "computed locally (Page 1954 tabular CUSUM; greedy binary segmentation, Scott and Knott 1974)", "summary": "1 change signal found in 10 values.", "verdict": "CHANGE_DETECTED" }, "type": "json" }