Title: Sketching the order of events,
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.