Discovering Significant Sequential Patterns in Data Stream by an Efficient Two-Phase Procedure

Algorithm 1

SSPsCandidates.

	Input: DS: dataset
	: support threshold
	k: user-specified length
	xs: testable support
	Output: SSPs candidates
	//create a Tree T and a header table H
(1)	T, H = CreateTree (DS, , xs)
	//find SSPs Candidates
(2)	Candidates = SSPs_Candidates (xs, T, H, base-item, k, and )
(3)	Output Candidates