Mining of Multiobjective Non-redundant Association Rules in Data Streams

  • Anamika Gupta
  • Naveen Kumar
  • Vasudha Bhatnagar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7268)

Abstract

Non-redundant association rule mining requires generation of both closed itemsets and their minimal generators. However, only a few researchers have addressed both the issues for data streams. Further, association rule mining is now considered as multiobjective problem where multiple measures like correlation coefficient, recall, comprehensibility, lift etc can be used for evaluating a rule. Discovery of multiobjective association rules in data streams has not been paid much attention.

In this paper, we have proposed a 3-step algorithm for generation of multiobjective non-redundant association rules in data streams. In the first step, an online procedure generates closed itemsets incrementally using state of the art CLICI algorithm and stores the results in a lattice based synopsis. An offline component invokes the proposed genMG and genMAR procedures whenever required. Without generating candidates, genMG computes minimal generators of all closed itemsets stored in the synopsis. Next, genMAR generates multiobjective association rules using non-dominating sorting based on user specified interestingness measures that are computed using the synopsis. Experimental evaluation using synthetic and real life datasets demonstrates the efficiency and scalability of the proposed algorithm.

Keywords

Data Stream Association Rule Minimal Generator Association Rule Mining Interestingness Measure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th International Conference on Very Large Databases, pp. 487–499 (1994)Google Scholar
  2. 2.
    Chang, J., Lee, W.: Finding Recent Frequent Itemsets Adaptively over Online Data stream. In: 9th ACM SIGKDD, pp. 487–492. ACM Press, New York (2003)Google Scholar
  3. 3.
    Cheng, J., Ke, Y., Ng, W.: A Survey on Algorithms for Mining Frequent Itemsets over Data stream. KAIS Journal 16(1), 1–27 (2008)MathSciNetGoogle Scholar
  4. 4.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transaction on Evolutionary Computation 6(2), 181–197 (2002)CrossRefGoogle Scholar
  5. 5.
    Geng, L., Hamilton, H.J.: Interestingness Measures for Data Mining: A Survey. ACM Computing Surveys, 38(3), Article 9 (2006)Google Scholar
  6. 6.
    Gupta, A., Bhatnagar, V., Kumar, N.: Mining Closed Itemsets in Data Stream Using Formal Concept Analysis. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol. 6263, pp. 285–296. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Han, J., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining: Current Status and Future Directions. Journal of DMKD 15, 55–86 (2007)MathSciNetGoogle Scholar
  8. 8.
    Heravi, M.J., Zaiane, O.R.: A Study on Interestingness Measures for Associative Classifiers. In: ACM Symposium on Applied Computing (2010)Google Scholar
  9. 9.
    Ishibuchi, H., Kuwajima, I., Nojima, Y.: Multiobjective Association Rule Mining. In: PPSN Workshop on Multiobjective Problem Solving from Nature (2006)Google Scholar
  10. 10.
    Jiang, N., Gruenwald, L.: CFI-Stream: Mining Closed Frequent Itemsets in Data stream. In: ACM SIGKDD, Poster Paper, pp. 592–597. ACM Press, New York (2006)Google Scholar
  11. 11.
    Jiang, N., Gruenwald, L.: Estimating Missing Data in Data Streams. In: International Conference on Database Systems for Advanced Applications, pp. 981–987 (2007)Google Scholar
  12. 12.
    Li, H., Ho, C., Lee, S.: Incremental Updates of Closed Frequent Itemsets Over Continuous Data stream. Expert Systems with Applications 36, 2451–2458 (2009)CrossRefGoogle Scholar
  13. 13.
    Pasquier, N., et al.: Efficient Mining of Association Rules using Closed Itemset Lattices. Journal of Information Systems 24(1), 25–46 (1999)CrossRefGoogle Scholar
  14. 14.
    Shin, S.J., Lee, W.S.: An On-line Interactive Method for Finding Association Rules Data Streams. ACM CIKM (2007)Google Scholar
  15. 15.
    Stumme, G., et al.: Computing Iceberg Concept Lattices with Titanic. Journal on Knowledge and Data Engineering 42(2), 189–222 (2002)MATHCrossRefGoogle Scholar
  16. 16.
    Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient Vertical Mining of Frequent Closures and Generators. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 393–404. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Tan, J., Bu, Y., Zhao, H.: Incremental Maintenance of Association Rules Over data Streams. In: International Conference on Networking and Digital Society (2010)Google Scholar
  18. 18.
    Vo, B., Le, B.: Fast algorithm for mining Minimal generators of FCI and their applications. In: IEEE International Conference on Computers and Industrial Engineering, pp. 1407–1411 (2009)Google Scholar
  19. 19.
    Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Catch the Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. Journal of Knowledge and Information Systems 10, 265–294 (2006)CrossRefGoogle Scholar
  20. 20.
    Zaki, M.J.: Generating Non-Redundant Association Rules. In: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34–43. ACM Press, New York (2000)CrossRefGoogle Scholar
  21. 21.
    Zaki, M.J.: Mining Non-Redundant Association Rules. In: Data Mining and Knowledge Discovery, vol. 9, pp. 223–248 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anamika Gupta
    • 1
  • Naveen Kumar
    • 1
  • Vasudha Bhatnagar
    • 1
  1. 1.Department of Computer ScienceUniversity of DelhiIndia

Personalised recommendations