State Space Realization Theorems For Data Mining
Robert L Grossman, Richard G Larson

TL;DR
This paper develops realization theorems for formal series related to events and profiles in data mining, utilizing Hopf algebra tools to formalize the mathematical foundation of predictive models.
Contribution
It introduces a novel application of Hopf algebra techniques to establish realization theorems for formal series in data mining contexts.
Findings
Proves realization theorems for formal series in data mining.
Uses Hopf algebra framework to analyze event-based models.
Provides mathematical foundation for predictive formal series.
Abstract
In this paper, we consider formal series associated with events, profiles derived from events, and statistical models that make predictions about events. We prove theorems about realizations for these formal series using the language and tools of Hopf algebras.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Algorithms and Data Compression · Fault Detection and Control Systems
