The Scientific World Journal

Research Article

Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets

Algorithm 2

Inputs:  min_sup: minimum support; min_conf: minimum confidence; FIS (frequent itemsets); inFIS (infrequent itemsets)
Output: PAR: set of +ve ARs; NAR: set of −ve ARs;
(1) ;
(2) /* generating all association rules from FIS (frequent itemsets). */
For  each itemset I in FIS
do begin
  for each itemset
  do begin
  (2.1) /* generate rules of the form . */
    If  
      then output the rule
    else
  (2.2) /* generate rules of the form and . */
      if  
        output the rule
      if  
        output the rule
      if  
        output the rule
  end for;
end for;
(3) /* generating all association rules from inFIS. */
For any itemset I in inFIS
do begin
  For each itemset ,  supp(A) ≥ minsupp and supp(B) ≥ minsupp
  do begin
  (3.1) /* generate rules of the form . */
    If  conf(   lift(
      then output the rule
    else
  (3.2) /* generate rules of the form ,   and . */
      if  
        output the rule
      if  
        output the rule
      if  
        output the rule
  end for;
end for;
(4) return PAR and NAR;