Rare association rule mining: An overview

Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection

Volumn , Issue , 2009, Pages 1-14

  Koh, Yun Sing ^a   Rountree, Nathan ^b  

^a AUCKLAND UNIVERSITY OF TECHNOLOGY   (New Zealand)

^b UNIVERSITY OF OTAGO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899315400     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-754-6.ch001     Document Type: Chapter

References (21)

1. Agrawal, R., Imielinski, T.,& Swami, A. (1993). Mining association rules between sets of items in large databases. In P. Buneman & S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD international conference on management of data (pp. 207-216). New York, NY: ACM Press.
2. Agrawal, R.,& Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (pp. 487-499). San Francisco, CA: Morgan Kaufmann Publishers Inc.
3. Bayardo, R. J. (1998). Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD '98 (pp. 85-93). New York, NY: ACM Press.
4. Bayardo, R. J.,& Agrawal, R. (1999). Mining the most interesting rules. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '99., (pp. 145-154). New York, NY: ACM Press.
5. Bayardo, R. J., Agrawal, R.,& Gunopulos, D. (2000). Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2/3), 217-240. doi:10.1023/A:1009895914772
6. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., & Motwani, R. (2001). Finding interesting association rules without support pruning. IEEE Transactions on Knowledge and Data Engineering, 13, 64-78. doi:10.1109/69.908981
7. Hahsler, M. (2006, September). A model-based frequency constraint for mining associations from transaction data. Data Mining and Knowledge Discovery, 13(2), 137-166. doi:10.1007/s10618-005-0026-2
8. Koh, Y. S.,& Rountree, N. (2005). Finding sporadic rules using Apriori-Inverse. In Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining 2005 (pp. 97-106). Berlin /Heidelberg: Springer.
9. Koh, Y. S., Rountree, N., & O'Keefe, R. A. (2008, January). Mining interesting imperfectly sporadic rules. Knowledge and Information Systems, 14(2), 179-196. doi:10.1007/s10115-007-0074-6
10. Li, J., Zhang, X., Dong, G., Ramamohanarao, K., & Sun, Q. (1999). Efficient mining of high confidence association rules without support threshold. In Proceedings of the 3rd European Conference on Principle and Practice of Knowledge Discovery in Databases, PKDD '99 (pp. 406-411).
11. Liu, B., Hsu, W.,& Ma, Y. (1999a). Mining association rules with multiple minimum supports. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 337-341). New York, NY: ACM Press.
12. Liu, B., Hsu, W.,& Ma, Y. (1999b). Pruning and summarizing the discovered associations. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 125-134). New York, NY: ACM Press.
13. Rahal, I., Ren, D., Wu, W.,& Perrizo, W. (2004). Mining confident minimal rules with fixed-consequents. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'04 (pp. 6-13). Washington, DC: IEEE Computer Society.
14. Seno, M.,& Karypis, G. (2001). LPMINER: An algorithm for finding frequent itemsets using length-decreasing support constraint. In N. Cercone, T. Y. Lin, & X. Wu (Eds), In Proceedings of the 2001 IEEE International Conference on Data Mining ICDM (pp. 505-512). Washington, DC: IEEE Computer Society.
15. Szathmary, L., Napoli, A.,& Valtchev, P. (2007). Towards Rare Itemset Mining. In Proceedings of the 19th IEEE international Conference on Tools with Artificial intelligence - Vol.1 (ICTAI 2007) - Volume 01 (October 29 - 31, 2007). ICTAI. (pp. 305-312). Washington, DC: IEEE Computer Society
16. Tao, F., Murtagh, F.,& Farid, M. (2003). Weighted association rule mining using weighted support and significance framework. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03 (pp. 661-666). New York, NY: ACM Press.
17. Wang, K., He, Y.,& Cheung, D. W. (2001). Mining confident rules without support requirement. In Proceedings of the Tenth International Conference on Information and Knowledge Management, (pp. 89-96). New York, NY: ACM Press.
18. Wang, K., He, Y., & Han, J. (2003). Pushing support constraints into association rules mining. IEEE Transactions on Knowledge and Data Engineering, 15(3), 642-658. doi:10.1109/TKDE.2003.1198396
19. Weiss, G. M. (2004). Mining with rarity: a unifying framework. SIGKDD Exploration Newsletter, 6(1), 7-19. doi:10.1145/1007730.1007734
20. Xiong, H., Tan, P.-N.,& Kumar, V. (2003). Mining strong affinity association patterns in data sets with skewed support distribution. In Proceedings of the Third IEEE International Conference on Data Mining (pp. 387-394). Washington, DC: IEEE Computer Society.
21. Yun, H., Ha, D., Hwang, B., & Ryu, K. H. (2003). Mining association rules on significant rare data using relative support. Journal of Systems and Software, 67(3), 181-191. doi:10.1016/S0164-1212(02)00128-0