Unverified50% confidenceFactExact time
Sliding-window aggregation is a common means of computing deviation features; the system maintains a time-rolling window and continuously aggregates statistics within the window, then compares them with the current transaction to derive a deviation score.
1
Sources
50%
Confidence
Long-term
Relevance
11/6/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedTwo-stack sliding window aggregation is a stream computing algorithm that uses two stacks to maintain a sliding window, completing element insertion and expiry deletion in O(1) amortised time, and querying the aggregate value within the window in real time.78% similarUnverifiedThe sliding time window is a commonly used rate-limiting algorithm in distributed systems, implemented by maintaining a timestamp queue or circular buffer, and can avoid the boundary spike problem of fixed windows.75% similarUnverifiedSliding windows, session windows and tumbling windows are the three basic operators of streaming feature computation; sliding windows suit continuously updated metrics, while session windows align with the natural boundaries of a call or a top-up behavior.73% similarUnverifiedIn stream computing, window aggregation is typically implemented with a state backend (such as Flink's keyed state), and the aggregation state for each customer dimension needs to be persisted and fault-tolerantly recovered.66% similarUnverifiedLoop detection can maintain a sliding window on top of state hashes, comparing the (action, state hash) tuples of the most recent N steps, and judging that a loop has been entered if the repetition rate within the window exceeds a threshold.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1143940API
curl https://kongchang.com/api/v1/knowledge/claims/1143940MCP
get_claim(id=1143940)