A Task Scheduling Algorithm Based on Classification Mining in Fog Computing Environment

Algorithm 1

I-Apriori algorithm.

1 Input: transaction database D; min_sup

2 Output: frequent itemsets L

3 C₁=find_candidate_1-itemsets(D);

4 int count=the number of TID in D;

5 for each itemset s of C₁

6s.item-set=s;

7s.count=count of s in C₁;

8 s.tid-list=the set of all TID includes s;

9 if s.countmin_supcount

10delete s in C₁;

11

12 L₁=C₁;

13 for (k=2; ≠; k++)

14for each itemset l₁ in

15for each itemset l₂ in

16c=l₁⋈l₂;

17c.tid-list= l₁.tid-listl₂.tid-list;

18c.count=count TID in c.tid-list;

19

20

21  if c.count>=min_supcount

22add c to ;

23L_k=C_k;

24