Sketching the order of events
classification
📊 stat.ML
cs.DSmath.STstat.TH
keywords
momentsorderfeaturesorderedstreamalgorithmsanalogyarbitrary
read the original abstract
We introduce features for massive data streams. These stream features can be thought of as "ordered moments" and generalize stream sketches from "moments of order one" to "ordered moments of arbitrary order". In analogy to classic moments, they have theoretical guarantees such as universality that are important for learning algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.