An Efficient Algorithm for Extracting High-Utility Hierarchical Sequential Patterns

Algorithm 1

Search for specific.

Input:S: the sequence, k: start index, visited, G

1: ifvisitedisfalsethen

2:  ifu(S) < ξthen

3:   return

4:  end if

5:   G ⟵ Filter(G ∪ S)

6: end if

7: for allr ∈ R(S,k) do

8:   S^’⟵ Replace(S,k,r)

9:   SearchForSpecific(S ,k,false,G)

10:  forv = k +1 ⟶ ldo

11:    SearchForSpecific(S ,v,true,G)

12:  end for

13: end for