Mining Informative Rule Set for Prediction

Journal of Intelligent Information Systems

Volumn 22, Issue 2, 2004, Pages 155-174

  Li, Jiuyong ^a   Shen, Hong ^b   Topor, Rodney ^c  

^a UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

Association rule; Data mining; Prediction

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; FORECASTING; INFORMATION ANALYSIS; LOGIC PROGRAMMING; SET THEORY; THEOREM PROVING;

ASSOCIATION RULES; INFORMATIVE RULE SETS; PREDICTION;

DATA MINING;

EID: 1442309101     PISSN: 09259902     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JIIS.0000012468.25883.a5     Document Type: Article

References (21)

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).
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.
3. Bayardo, R. and Agrawal, R. (1999). Mining the Most Interesting Rules. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 145-154). N.Y.: ACM Press.
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).
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).
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).
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.
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).
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.
10. Mitchell, T.M. (1997). Machine Learning. MCGraw-Hill.
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.
12. 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.
13. 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.
14. 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.
15. 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).
16. 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.
17. 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.
18. 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).
19. 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.
20. Zaki, M.J. (2000). Generating Non-Redundant Association Rules. In 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 34-43).
21. 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.