Research Article
An Asynchronous Periodic Sequential Pattern Mining Algorithm with Multiple Minimum Item Supports for Ad Hoc Networking
Input: parameters and their meaning are shown in Table 5 | Output: simulation data set | () FOR to do | () p.period = GaussianDist(, MAXPER); | () p.pattern = GenPattern(p.period, , ); | () position = UniformDist(); | () WHILE () DO | () p.local = GeometricDist(, MAX = ); | () IF (-position < p.local * p.period) THEN break; | () FOR to p.local DO | () position+=p.period; | () insert p.pattern into TIDS[position]; | () ENDFOR | () p.disturbance = p.period * GeometricDist(, MAXDIS); | () postion+=p.disturbance; | () ENDWHILE | () ENDFOR | () FOR to DO | () = PoissonDist(, MAX = ); | () = ; | () random generate symbols with ; | () ENDFOR |
|