“…If a rule contains quantitative attributes either in antecedent or consequent, then the rule is termed as quantitative association rule (Srikant & Agrawal, 1996;Moreno, Segrera, Lopez, & Polo, 2006). Some efficient algorithms for association rule mining proposed in the literature are: APRIORI (Agrawal & Srikant, 1994), PRICES (Wang & Tjortjis, 2004), ChARM (Zaki & Hsiao, 1999) and CLOSET (Brin, Motwani, & Silverstein, 1997), Elcat (Zaki, 2000), FPgrowth (Han, Pei, Yin, & Mao, 2004), OPUS (Webb, 1995), GUHA (Hajek, Havel, & Chytil, 1966) and FARM-AP (Hooshsadat, Samuel, Patel, & Zalance, 2011). Some algorithms used for frequent item sets generation are: MAFIA (Burdick, Calimlim, Flannick, Gehrke, & Yiu, 2005), TFP (Jianyong, Han, Lu, & Tzvetkov, 2005) and estMax (Woo & Lee, 2009).…”