BtspESMiner(SequenceGraph graph,
double resampleRatio,
int bootstrapCount) |
Given an event sequence graph (esGraph), BtspESMiner randomly resamples the sequence edges
in the graph, and simply creates a subgraph.
|
ESGrowthMiner(SequenceGraph esGraph,
double threshold) |
Given an event sequence graph (esGraph), and a prevalence threshold for the
frequency of the STESs, this finds all the STESs using the instance sequences
from the event sequence graph.
|
ESMiner(SequenceGraph esGraph) |
|
NaiveTopRKESMiner(SequenceGraph esGraph,
double rPercent,
int K) |
|
SequenceConnectMiner(SequenceGraph esGraph,
double threshold) |
Given the follow relationships (in the form of event sequence graph
(esGraph)), and a prevalence threshold STESs, this finds all the event
sequences using Apriori based SequenceConnect algorithm.
|
TopRKESMiner(SequenceGraph esGraph,
double rPercent,
int K) |
Given an event sequence graph (esGraph), and a significance threshold for the
co-occurrences of head and tail window of instances, this finds all the event
sequences in the graph
|