Advertisement

Journal of Intelligent Information Systems

, Volume 22, Issue 2, pp 155–174 | Cite as

Mining Informative Rule Set for Prediction

  • Jiuyong Li
  • Hong Shen
  • Rodney Topor
Article

Abstract

Mining transaction databases for association rules usually generates a large number of rules, most of which are unnecessary when used for subsequent prediction. In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the association rule set by the confidence priority. We call this rule set informative rule set. The informative rule set is not constrained to particular target items; and it is smaller than the non-redundant association rule set. We characterise relationships between the informative rule set and non-redundant association rule set. We present an algorithm to directly generate the informative rule set without generating all frequent itemsets first that accesses the database less frequently than other direct methods. We show experimentally that the informative rule set is much smaller and can be generated more efficiently than both the association rule set and non-redundant association rule set.

association rule data mining prediction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., and Swami, A. (1993). Mining Associations Between Sets of Items in Massive Databases. In Proc. of the ACM SIGMOD Int'l Conference on Management of Data (pp. 207-216).Google Scholar
  2. Agrawal, R. and Srikant, R. (1994). Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the Twentieth International Conference on Very Large Databases (pp. 487-499). Santiago, Chile.Google Scholar
  3. Bayardo, R. and Agrawal, R. (1999). Mining the Most Interesting Rules. In Proceedings of the Fifth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 145-154). N.Y.: ACM Press.Google Scholar
  4. Bayardo, R., Agrawal, R., and Gunopulos, D. (1999). Constraint-Based Rule Mining in Large, Dense Database. In Proc. of the 15th Int'l Conf. on Data Engineering (pp. 188-197).Google Scholar
  5. Han, J., Pei, J., and Yin, Y. (2000). Mining Frequent Patterns Without Candidate Generation. In Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD'00) (pp. 1-12).Google Scholar
  6. Holsheimer, M., Kersten, M., Mannila, H., and Toivonen, H. (1995). A Perspective on Databases and Data Mining. In 1st Intl. Conf. Knowledge Discovery and Data Mining (p. 10).Google Scholar
  7. Houtsma, M. and Swami, A. (1995). Set-Oriented Mining for Association Rules in Relational Databases. In Proceedings of the 11th International Conference on Data Engineering (pp. 25-34). Los Alamitos, CA, USA: IEEE Computer Society Press.Google Scholar
  8. Liu, B., Hsu, W., and Ma, Y. (1999). Pruning and Summarizing the Discovered Associations. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (SIGKDD 99).Google Scholar
  9. Mannila, H., Toivonen, H., and Verkamo, I. (1994). Efficient Algorithms for Discovering Association Rules. In AAAI Wkshp. Knowledge Discovery in Databases (pp. 181-192). AAAI Press.Google Scholar
  10. Mitchell, T.M. (1997). Machine Learning. McGraw-Hill.Google Scholar
  11. Ng, R., Lakshmanan, L., Han, J., and Pang, A. (1998). Exploratory Mining and Pruning Optimizations of Constrained Associations Rules. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98) (pp. 13-24). ACM SIGMOD Record 27(2), New York: ACM Press.Google Scholar
  12. Park, J.S., Chen, M., and Yu, P.S. (1995). An Effective Hash Based Algorithm for Mining Association Rules. In ACM SIGMOD Intl. Conf. Management of Data.Google Scholar
  13. Rymon, R. (1992). Search Through Systematic Set Enumeration. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (pp. 539-552) Cambridge, MA: Morgan Kaufmann.Google Scholar
  14. Savasere, A., Omiecinski, R., and Navathe, S. (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. In Proceedings of 21th International Conference on Very Large Data Bases (VLDB95) (pp. 432-444).Google Scholar
  15. Shenoy, P., Haritsa, J.R., Sudarshan, S., Bhalotia, G., Bawa, M., and Shah, D. (1999). Turbo-Charging Vertical Mining of Large Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-99) (pp. 22-33). ACM SIGMOD Record 29(2), Dallas, Texas: ACM Press.Google Scholar
  16. Toivonen, H., Klemettinen, M., RonKainen, P., Hatonen, K., and Mannila, H. (1995). Pruning and Grouping Discovered Association Rules. In Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases (pp. 47-52).Google Scholar
  17. Webb, G.I. (2000). Efficient Search for Association Rules. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-00), (pp. 99-107). N.Y.: ACM Press.Google Scholar
  18. Zaki, M.J. (2000). Generating Non-Redundant Association Rules. In 6th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 34-43).Google Scholar
  19. Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. (1997). New Algorithms for Fast Discovery of Association Rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97) (p. 283). AAAI Press.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  1. 1.Department of Mathematics and ComputingUniversity of Southern QueenslandToowoombaAustralia
  2. 2.Graduate School of Information ScienceJapan Advanced Institute of Science and Technology, TatsunokuchiIshikawaJapan
  3. 3.School of Computing and Information TechnologyGriffith UniversityNathanAustralia

Personalised recommendations