Frequent itemset mining and association rules

Encyclopedia of Knowledge Management

Volumn , Issue , 2005, Pages 197-203

  Imberman, Susan ^a   Tansel, Abdullah Uz ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84870152240     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-59140-573-3.ch026     Document Type: Chapter

References (20)

1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of ACM SIGMOD (pp. 207-216).
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., & Verkamo, A.I. (1996). Fast discovery of association rules. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, & R. Uthurusamy (Eds.), Advances in knowledge discovery and data mining (pp. 307-328). Boston: AAAI/MIT Press.
3. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. IBM Res. Rep. RJ9839, IBM Almaden.
4. Aumann, Y., & Lindell, Y. (1999). A statistical theory for quantitative association rules. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 261-270).
5. Ayan, N.F., Tansel, A.U., & Arkun, E. (1999). An efficient algorithm to update large itemsets with early pruning. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 287-291).
6. Brin, S., Motwani, R. Ullman, J., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. Proceedings of ACM SIGMOD (pp. 255-264).
7. Cox, K.C., Eick, S.G., Wills, G.J., & Brachman, R.J. (1997). Visual data mining: Recognizing telephone calling fraud. Data Mining and Knowledge Discovery, 1(2), 225-231.
8. Fayyad, U.M., Piaetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery: An overview. Advances in knowledge discovery and data mining. Cambridge, MA: AAAI/MIT Press.
9. Fukada, T., Yasuhiko, M., Sinichi, M., & Tokuyama, T. (1996). Mining optimized association rules for numeric attributes. Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 13-23).
10. Gosta, G., & Zhu, J. (2003). Efficiently using prefix-trees in mining frequent itemsets. Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations. Retrieved from http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-90/
11. Imberman, S.P., Domanski, B., & Thompson, H.W. (2002). Using dependency/association rules to find indications for computerized tomography in a head trauma dataset. Artificial Intelligence in Medicine, 26(1), 55-68.
12. Imberman, S.P., Tansel, A.U., & Pacuit, E. (2004). An efficient method for finding emerging large itemsets. Proceedings of the 3rd Workshop on Mining Temporal and Sequential Data, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
13. Park, J.S., Chen, M.S., & Yu, P.S. (1995). An effective hash based algorithm for mining association rules. Proceedings of ACM SIGMOD (pp. 175-186).
14. Sahar, S. (1999). Interestingness via what is not interesting. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 332-336).
15. Sahar, S., & Mansour, Y. (1999). An empirical evaluation of objective interestingness criteria. Proceedings of the SPIE Conference on Data Mining and Knowledge Discovery (pp. 63-74).
16. Sahar, S. (2002). Exploring interestingness through clustering: A framework. Proceedings of the IEEE International Conference on Data Mining (ICDM 2002) (pp. 677-681).
17. Savasere, A., Omiecinski, E., & Navathe, S. (1998). An efficient algorithm for mining association rules in large databases. Proceedings of the IEEE International Conference of Data Engineering (ICDE 1998) (pp. 494-502).
18. Silverstein, C., Brin, S., & Motwani, R. (1998). Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2(1), 39-68.
19. Srikant, R., & Agrawal, R. (1996). Mining quantitative association rules in large relational tables. Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 1-12).
20. nd International Conference on Very Large Databases (VLDB'96) (pp. 135-145).