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

Algorithm 4

Given:   supp(𝐴∪𝐵)<minsupp, and supp(𝐴∪𝐵)≠0

    supp(𝐴)≥minsupp, and

      supp(𝐵)≥minsupp,

If    conf(𝐴⇒𝐵)≥minconf, and

  lift(𝐴⇒𝐵)>1

   then 𝐴⇒𝐵 is a valid positive rule, having required minimum confidence and there

   is a positive correlation between rule items A and B.

Else If

  conf(𝐴⇒¬𝐵)≥minconf, and

  lift(𝐴⇒¬𝐵)>1

   then 𝐴⇒¬𝐵 is a valid negative rule, having required minimum confidence and there

   is a positive correlation between rule items A and ¬B.