Bit Resultant Matrix for Mining Quantitative Association Rules of Bipolar Item Sets

  • Dileep Kumar KodaEmail author
  • P. Vinod Babu
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 5)


Association rule learning is a familiar technique for finding interesting relations that exist between variables in immense databases. Existing mining techniques which are available at present cannot pay attention to negative dependencies and considering only one evaluation criteria for measuring quantity of obtained rules. But for better results, data sets demanding for populating negative associations. To overcome the problem, proposing a technique called Bit Vector (BV) generation for mining quantitative association rules of bipolar (Positive and Negative) item sets together. Proposed system can reduce time complexity of finding recurrent item sets of bipolar association rules and provide more flexibility for finding the frequent item sets.


Association rule mining Frequent item sets Infrequent item sets Negative association rule mining Bit vectors 


  1. 1.
    R. Renesse, K. Birman, and W. Vogels, “Astrolabe: A robust and scalable technology for distributed systems monitoring, management, and data mining,” ACM Transactions on Computational System, volume. 21, No. 2, pp. 164–206, 2003.Google Scholar
  2. 2.
    J. Han and M. Kamber, “Data Mining Concepts and Techniques”, 2nd ed. Burlington, MA, USA: Morgan Kaufmann, 2006.Google Scholar
  3. 3.
    C. Zhang and S. Zhang, “Association rule mining: Models and algorithms,” in Lecture Notes Computer Science (LNAI 2307). Berlin/Heidelberg, Germany Springer-Verlag, 2002.Google Scholar
  4. 4.
    R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases,” in Proc. SIGMOD, 1993, pp. 207–216.Google Scholar
  5. 5.
    R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proc. Int. Conf. Large Data Bases, 1994, pp. 487–499.Google Scholar
  6. 6.
    R. Srikant and R. Agrawal, “Mining quantitative association rules in large relational tables,” in Proc. ACM SIGMOD, 1996, pp. 1–12.Google Scholar
  7. 7.
    X. Yan, C. Zhang, and S. Zhang, “Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support,” Expert Syst. Appl., vol. 36, no. 2, pp. 3066–3076, 2009.Google Scholar
  8. 8.
    J. Alcala-Fdez, N. Flugy-Pape, A. Bonarini, and F. Herrera, “Analysis of the effectiveness of the genetic algorithms based on extraction of association rules,” Fund. Inf., vol. 98, no. 1, pp. 1001–1014, 2010.Google Scholar
  9. 9.
    D. Goldberg,“Genetic Algorithms in Search, Optimization and Machine Learning”. Reading, MA, USA/White Plains, NY, USA: Addison- Wesley/Longman, 1989.Google Scholar
  10. 10.
    B. Alatas and E. Akin, “MODENAR: Multi-objective differential evolution algorithm for mining numeric association rules,” Appl. Soft Comput., vol. 8, no. 1, p. 646, 2008.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.Anil Neerukonda Institute of Technology and Sciences (ANITS)VisakhapatnamIndia

Personalised recommendations