An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules

Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the discovering frequent items and the mining of positive rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. But these algorithms do not consider negation occurrence of the attribute in them and also these rules are not in infrequent form. The discovery of infrequent itemsets is far more difficult than their counterparts, that is, frequent itemsets. These problems include infrequent itemsets discovery and generation of interest negative association rules, and their huge number as compared with positive association rules. The interesting discovery of association rules is an important and active area within data mining research. In this paper, an efficient algorithm is proposed for discovering interesting positive and negative association rules from frequent and infrequent items. The experimental results show the usefulness and effectiveness of the proposed algorithm.

@article{Abdul-WahabAl-Opahi2015,
  title     = {An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {6},
  number    = {6},
  year      = {2015},
  publisher = {The Science and Information Organization},
  author    = {Ahmed Abdul-WahabAl-Opahi and Basheer Mohamad Al-Maqaleh},
  doi       = {10.14569/IJACSA.2015.060623},
  url       = {https://doi.org/10.14569/IJACSA.2015.060623}
}