An Asynchronous Periodic Sequential Pattern Mining Algorithm with Multiple Minimum Item Supports for Ad Hoc Networking

Algorithm 4

MergeSeg (prefix_segs, svs_set, prefix_sum, min_sup, and max_dis).

Input: prefix segments prefix_segs, contain segments set svs_set, repeat count of prefix segments prefix_sum, minimum support

min_sup, maximum interference distance max_dis

()   VSQ ← ⌀;

()   FOR each in svs_set    DO

()    tail ← .start + ..);

()     IF ((.) > ) THEN break;

()     ELSE IF (tail > .start) THEN continue;

()     ELSE  VSQ ← VSQ ;

()   ENDFOR

()   FOR each in VSQ DO

()    newprefix_segs ← prefix_segs   ;

()  newprefix_sum ← prefix_sum + .rep;

()  newsvs_set ← svs_set delete segments before ;

()   IF  (newprefix_sum ≥ min_sup) && (_item ∈ pattern) THEN

()  Output(newprefix_segs);

()  MergeSeg (newprefix_segs, newsvs_set, prefix_sum, min_sup, max_dis);

() ENDFOR