Automatic Classification Algorithm for Multisearch Data Association Rules in Wireless Networks

Algorithm 1

I-Apriori algorithm.

Input: database (), minimum support (min_ sup);

Output: frequent item set ().

 = find_candidate_1-itemsets ();

Int count = the number of TID in ;

For each item set of {.

 s.item-set = ;

 s.count = count of in ;

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

 If s.count<min_sup count.

   delete in ;

}

;

for (; ; ++){.

 for each item set 1₁ in .

  for each item set 1₂ in {.

   c.Tid-list =11,Tid-list;

   c.count = count TID in c.Tid-list;

}

  if c.count> = min_sup count.

 add to ;

 .

}