Direct interesting rule generation

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 155-162

  Li, Jiuyong ^a   Zhang, Yanchun ^b  

^a UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

^b VICTORIA UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149123157     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining associations between sets of items in massive databases. In Proc. of the ACM SIGMOD Int'l Conference on Management of Data, pages 207-216, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 487-499, Santiago, Chile, 1994.
3. R. Bayardo and R. Agrawal. Mining the most interesting rules. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 145-154, N.Y., 1999. ACM Press.
4. R. Bayardo, R. Agrawal, and D. Gunopulos. Constraintbased rule mining in large, dense database. In Proc. of the 15th Int'l Conf. on Data Engineering, pages 188-197, 1999.
5. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. SIGMOD Record (ACM Special Interest Group on Management of Data), 26(2):265, 1997.
6. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings, ACM SIGMOD International Conference on Management of Data: SIGMOD 1997: May 13-15, 1997, Tucson, Arizona, USA, volume 26(2), pages 255-264, NY, USA, 1997. ACM Press.
7. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Machine Learning - EWSL-91, pages 151-163, 1991.
8. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. In 16th International Conference on Data Engineering (ICDE' 00), pages 489-500, Washington - Brussels - Tokyo, 2000. IEEE.
9. V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Transactions on Knowledge and Data Engineering, 5(6), 1993.
10. T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 4-6, 1996, pages 13-23, New York, 1996. ACM Press.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD'00), pages 1-12, May, 2000.
12. J. Li, H. Shen, and R. Topor. Mining the smallest association rule set for prediction. In Proceedings of 2001 IEEE International Conference on Data Mining (ICDM 2001), pages 361-368. IEEE Computer Society Press, 2001.
13. J. Li, H. Shen, and R. Topor. Mining the optimal class association rule set. Knowledge-Based System, 15(7):399-405, 2002. (Pubitemid 34614259)
14. J. Li, H. Shen, and R. Topor. Mining informative rule set for prediction. Journal of intelligent information systems, in press.
15. R. Michalski, I. Mozetic, J. Hong, and N. Lavrac. The AQ15 inductive learning system: an overview and experiments. In Proceedings of IMAL 1986, Orsay, 1986. Université de Paris-Sud.
16. T. M. Mitchell. Machine Learning. McGraw-Hill, 1997.
17. J. S. Park, M. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In ACM SIGMOD Intl. Conf. Management of Data, 1995.
18. G. Piatetsky-Shapiro. Discovery, analysis and presentation of strong rules. In G. Piatetsky-Shapiro, editor, Knowledge Discovery in Databases, pages 229-248. AAAI Press / The MIT Press, Menlo Park, California, 1991.
19. P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-99), ACM SIGMOD Record 29(2), pages 22-33, Dallas, Texas, 1999. ACM Press.
20. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proceedings of the eighth ACMKDD international conference on knowledge discovery and data mining, pages 32 - 41, Edmonton, Canada, 2002. ACM press.
21. G. I. Webb. OPUS: An efficient admissible algorithm for unordered search. In Journal of Artificial Intelligence Research, volume 3, pages 431-465, 1995.
22. G. I. Webb. Efficient search for association rules. In Proceedinmgs of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-00), pages 99-107, N. Y., 2000. ACM Press.
23. M. J. Zaki. Generating non-redundant association rules. In 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 34-43, August 2000.
24. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), page 283. AAAI Press, 1997.
25. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proceedings of the seventh International Conference on Knowledge Discovery and Data Mining (SIGKDD-01), 2001.