Positive and Negative Association Rule Mining Using Correlation Threshold and Dual Confidence Approach

  • Animesh PaulEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 410)


Association Rule Generation has reformed into an important area in the research of data mining. Association rule mining is a significant method to discover hidden relationships and correlations among items in a set of transactions. It consists of finding frequent itemsets from which strong association rules of the form A => B are generated. These rules are used in classification, cluster analysis and other data mining tasks. This paper presents an extensive approach to the traditional Apriori algorithm for generating positive and negative rules. However, the general approaches based on the traditional support–confidence framework may cause to generate a large number of contradictory association rules. In order to solve such problems, a correlation coefficient is determined and augmented to the mining algorithm for generating association rules. This algorithm is known as the Positive and Negative Association Rules generating (PNAR) algorithm. An improved PNAR algorithm is proposed in this paper. The experimental result shows that the algorithm proposed in this paper can reduce the degree of redundant and contradictory rules, and generate rules which are interesting on the basis of a correlation measure and dual confidence approach.


Data mining Itemset Frequent itemset Infrequent itemset Apriori Positive and negative association rules Minimum support Different minimum support Minimum confidence Dual confidence Correlation coefficient Correlation threshold 


  1. 1.
    Junwei, L.U.O., Bo, Z.: Research on mining positive and negative association rules. In: International Conference on Computer and Communication Technologies in Agricultural Engineering, pp. 302–304. (2010)Google Scholar
  2. 2.
    Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in massive databases. In: ACM SIGMOID International Conference on Management of Data, ACM, Washington D.C., pp. 207–216. (1993)Google Scholar
  3. 3.
    Brin, S., Motwani, R., Silverstein, C.: Beyond market generalizing association rules to correlations. In: Processing of the ACM SIGMOID Conference, pp. 265–276. ACM Press (1997)Google Scholar
  4. 4.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Databases (VLDB), pp. 487–499. Santiago, Chile (1994)Google Scholar
  5. 5.
    Zhu, H., Xu, Z.: An effective algorithm for mining positive and negative association rules. In: International Conference on Computer Science and Software Engineering, pp. 455–458. (2008)Google Scholar
  6. 6.
    Han, J., Kamber, M., Pei, J.: Mining frequent patterns, associations and correlations: basic concepts and methods., advanced pattern mining. In: DATA MINING Concepts and Techniques, 3rd edn. Waltham, MA 02451, USA: Elsevier, pp. 243–317. (2011)Google Scholar
  7. 7.
    Chen, M., Han, J., Yu, P.: Data mining: an overview from a database perspective. IEEE Trans. Knowl. Data Eng. 8(6), 866–883 (1996)CrossRefGoogle Scholar
  8. 8.
    Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: ACM SIGMOID International Conference on Management of Data, pp. 175–186. San Jose, California (1995)Google Scholar
  9. 9.
    Savasere, A., Omiecinski, E., Navathe, S.: An Efficient algorithm for mining association rules in large databases. In: International Conference on Very Large Databases (VLDB), pp. 1–24. Zurich, Switzerland (1995)Google Scholar
  10. 10.
    Dong, X., Wang, S., Song, H., Lu, Y.: Study on negative association rules. Trans. Beijing Inst. Technol. 24(11), 978–981 (2004)MathSciNetGoogle Scholar
  11. 11.
    Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst. 22(3), 381–405 (2004)CrossRefGoogle Scholar
  12. 12.
    Piao, X., Wang, Z., Liu, G.: Research on mining positive and negative association rules based on dual confidence. In: Fifth International Conference on Internet Computing for Science and Engineering, pp. 102–105. (2010)Google Scholar
  13. 13.
    Geng, L., Hamilton, H.J.: Interestingness measures for data mining: a survey. ACM Comput. Surv. 1–32 (2006)Google Scholar
  14. 14.
    Jalali-Heravi, M., Zaiane, O.R.: A study on interestingness measures for associative classifiers. In: Proceedings of the ACM Symposium on Applied Computing, pp. 1039–1046. (2010)Google Scholar
  15. 15.
    Teng, W., Hsieh, M., Chen, M.: On the mining of substitution rules for statistically dependent items. In: International Conference on Data Mining, pp. 442–449. (2002)Google Scholar
  16. 16.
    Kavitha, J.K., Manjula, D.: Recent study of exploring association rules from dynamic datasets. Int. J. Adv. Res. Comput. Sci. Manag. Stud. 2(11), 236–243 (2014)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringNational Institute of Technology, MizoramAizawlIndia

Personalised recommendations