Mining Experiential Patterns from Game-Logs of Board Game

Algorithm 4

CBSSFinding.

Procedure  CBSSFinding

Input:

 minSupport, the minimum support threshold.

 root, the root node of the sequence-tree.

 total: the total number of sequences.

 sps, the set of the found CBSSs.

Output:

 Updated sps.

Method:

(01) let  supp be the support of a CBSS;

(02) let  sp be the instance of SequentialPattern;

(03) if  root.branches == null then

(04) return;

(05) endif

(06) for to  root.branches.length − 1do

(07) supp = root.branches[].weight/total;

(08) if  supp  ≥ minSupport  then

(09)  sp = new SequentialPattern();

(10)  sp.premise = root.value;

(11)   sp.result = root.branches[].next.value;

(12)  sp.support = supp;

(13)  sps.add(sp);

(14) endif

(15) CBSSFinding(minSupport, root.branches[].next, total, sps);

(16) endfor