Parametrised event primitives

Parametrised event primitives (PEPs) are a way to incorporate background knowledge into the architecture. They define different ``shapes'' in the channels we are examining. A PEP consists of the following:

• A set of parameters , which describe a particular parametrised event. Let represent the range of the parameter . Let P be the space of possible parameter values, i.e. . Let P be known as the parameter space.
• A finding function f which takes a channel c and returns a set of parametrised events E. Each event in E is an element of P.

Each parametrised event primitive (PEP) is described by a set of parameters along with a function for extracting instances of that event primitive. Thus, by applying the finding function, we can find all the events that appear to be an instance of an event primitive we are considering. Example PEPs are discussed below.

• Example PEP: A ``straight-line'' approximation for continuous-valued channels
• Example PEP: ``Delta'' detection for discrete-valued attributes