Continuous post-mining of association rules in a data stream management system

Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction

Volumn , Issue , 2009, Pages 116-132

  Thakkar, Hetal ^a   Mozafari, Barzan ^a   Zaniolo, Carlo ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b US Research Consortium   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892228404     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-404-0.ch007     Document Type: Chapter

References (40)

1. Aggarwal, C. C., & Yu, P. S. (1998). Online generation of association rules. In ICDE (pp. 402-411).
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB (pp. 487-499).
3. Bai, Y., Thakkar, H., Wang, H., Luo, C., & Zaniolo, C. (2000). A data stream language and system designed for power and extensibility. In CIKM (pp.337-346).
4. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., & Lakhal, L. (2000). Mining minimal non-redundant association rules using frequent closed itemsets. In First International Conference on Computational Logic (pp. 972-986).
5. Brin, S., Motwani, R., & Silverstein, C. (1997). Beyond market baskets: Generalizing association rules to correlations. In SIGMOD (pp. 265-276).
6. Brin, S., Motwani, S., Ullman, J. D., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In SIGMOD (pp. 255-264).
7. Calders, T., Goethals, B., & Prado, A. (2006) Integrating pattern mining in relational databases. In PKDD, volume 4213 of Lecture Notes in Computer Science (pp. 454-461). Springer.
8. th Database Engineering and Applications Symposium International Proceedings, (pp.111-116).
9. Chi, Y., Wang, H., Yu, P. S., & Muntz, R. R. (2004). Moment: Maintaining closed frequent itemsets over a stream sliding window. In ICDM (pp 59-66).
10. Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X. (1998). Incremental clustering for mining in a data warehousing environment. In VLDB (pp. 323-333).
11. Guillet, E., & Hamilton, H. J. (Ed.). (2007). Quality Measures in Data Mining. Studies in Computational Intelligence. Springer.
12. Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In SIGMOD (pp. 1-12).
13. Jiang, N., & Gruenwald, D. L. (2006). Cfi-stream: mining closed frequent itemsets in data streams. In SIGKDD (pp. 592-597).
14. Jiang, N., & Gruenwald, L. (2006). Research issues in data stream association rule mining. SIGMOD Record (pp. 14-19).
15. Kumar, K. B., & Jotwani, N. (2006). Efficient algorithm for hierarchical online mining of association rules. In COMAD.
16. Lee, C., Lin, C., & Chen, M. (2005). Sliding window filtering: an efficient method for incremental mining on a time-variant database. Information Systems (pp. 227-244).
17. Lehmann, E. (1959). Testing Statistical Hypotheses. Wiley, New York.
18. Leung, C.-S., Khan, Q., & Hoque, T. (2005). Cantree: A tree structure for efficient incremental mining of frequent patterns. In ICDM (pp. 274-281).
19. Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and efficient classification based on multiple classassociation rules. In ICDM (pp. 369-376).
20. Liu, B., Hsu, W., & Ma, Y. (1999). Pruning and summarizing the discovered associations. In KDD (pp. 125-134).
21. Liu, B., Hu, M., & Hsu, W. (2000). Multi-level organization and summarization of the discovered rules. In Knowledge Discovery and Data Mining (pp. 208-217).
22. Liu, B., Ma, Y., & Lee, R. (2001). Analyzing the interestingness of association rules from the temporal dimension. In ICDM (pp. 377-384).
23. Mao, G., Wu, X., Zhu, X., Chen, G., & Liu, C. (2007). Mining maximal frequent itemsets from data streams. Information Science (pp. 251-262).
24. Mozafari, B., Thakkar, H., & Zaniolo, C. (2008). Verifying and mining frequent patterns from large windows over data streams. ICDE (pp. 179-188).
25. Park, J. S., Chen, M.-S., & Yu, P. S. (1995). An effective hash-based algorithm for mining association rules. In SIGMOD (pp. 175-186).
26. Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Efficient mining of association rules using closed itemset lattices. Information Systems (pp. 25-46).
27. Pei, J., Han, J., & Mao, R. (2000). CLOSET: An efficient algorithm for mining frequent closed itemsets. In SIGMOD (pp. 21-30).
28. Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. (2004). Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE TKDE, 16(11), 1424-1440.
29. Piatetsky-Shapiro, G. (1991). Discovery, analysis, and presentation of strong rules. In KDD.
30. Sadri, R., Zaniolo, C., Zarkesh, A., & Adibi, J. (2001). Optimization of sequence queries in database systems. In PODS (pp. 71-81).
31. Sheikh, L., Tanveer, B., & Hamdani, M. (2004). Interesting measures for mining association rules. Multitopic Conference INMIC, 8th International (pp. 641-644).
32. Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In EDBT (pp. 3-17).
33. Tan, P., Kumar, V., & Srivastava, J. (2002). Selecting the right interestingness measure for association patterns. In Knowledge Discovery and Data Mining (pp. 32-41).
34. Tang, Z., Maclennan, J., & Kim, P. (2005). Building data mining solutions with OLE DB for DM and XML analysis. SIGMOD Record, 34(2), 80-85.
35. Thakkar, H., Mozafari, B., & Zaniolo, C. (2008). Designing an inductive data stream management system: the stream mill experience. In SSPS (pp. 79-88).
36. Wang, H., Fan, W., Yu, P. S., & Han, J. (2003). Mining concept-drifting data streams using ensemble classifiers. In SIGKDD (pp. 226-235).
37. Wang, H., & Zaniolo, C. (2003). Atlas: a native extension of sql for data minining. In Proceedings of Third SIAM Int. Conference on Data Mining (pp.130-141).
38. Won, D., & McLeod, D. (2007). Ontology-driven rule generalization and categorization for market data. Data Engineering Workshop, 2007 IEEE 23rd International Conference on (pp. 917-923).
39. Yu, J., Chong, Z., Lu, H., Zhang, Z., & Zhou, A. A false negative approach to mining frequent itemsets from high speed transactional data streams. Inf. Sci. 176(14).
40. Zaki, M. J., & Hsiao, C. (2002). CHARM: An efficient algorithm for closed itemset mining. In SIAM.