Mining generalized closed frequent itemsets of generalized association rules

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2773 PART 1, Issue , 2003, Pages 476-484

  Sriphaew, Kritsada ^a   Theeramunkong, Thanaruk ^a  

^a THAMMASAT UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; LOGIC PROGRAMMING; NUMERICAL METHODS; SET THEORY; ASSOCIATION RULES; KNOWLEDGE BASED SYSTEMS;

ASSOCIATION RULE MINING (ARM); CLOSED FREQUENT ITEMSETS; GENERALIZED ASSOCIATION RULES; CLOSED ITEMSETS; GENERALIZED ASSOCIATION RULE MINING; KNOWLEDGE DISCOVERY IN DATABASE; MINIMUM SUPPORT; REAL DATA SETS; TRADITIONAL APPROACHES;

ASSOCIATIVE PROCESSING; DATABASE SYSTEMS;

EID: 8344277983     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45224-9_66     Document Type: Conference Paper

References (13)

1. Agrawal, R., Imielinski, T., Swami, A. N.: Mining association rules between sets of items in large databases. In Buneman, P., Jajodia, S., eds.: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D. C. (1993) 207-216
2. Srikant, R., Agrawal, R.: Mining generalized association rules. Future Generation Computer Systems 13 (1997) 161-180
3. Hipp, J., Myka, A., Wirth, R., Güntzer, U.: A new algorithm for faster mining of generalized association rules. In: Proceedings of the 2nd European Conference on Principles of Data Mining and Knowledge Discovery (PKDD '98), Nantes, France (1998) 74-82
4. Chung, F., Lui, C.: A post-analysis framework for mining generalized association rules with multiple minimum supports (2000) Workshop Notes of KDD'2000 Workshop on Post-Processing in Machine Learing and Data Mining
5. Han, J., Fu, Y.: Mining multiple-level association rules in large databases. Knowledge and Data Engineering 11 (1999) 798-804
6. Lui, C. L., Chung, F. L.: Discovery of generalized association rules with multiple minimum supports. In: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD '2000), Lyon, France (2000) 510-515
7. Shintani, T., Kitsuregawa, M.: Parallel mining algorithms for generalized association rules with classification hierarchy. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. (1998) 25-36
8. Michail, A.: Data mining library reuse patterns using generalized association rules. In: International Conference on Software Engineering. (2000) 167-176
9. Hwang, S. Y., Lim, E. P.: A data mining approach to new library book recommendations. In: Lecture Notes in Computer Science ICADL 2002, Singapore (2002) 229-240
10. Sriphaew, K., Theeramunkong, T.: A new method for fiding generalized frequent itemsets in generalized association rule mining. In Corradi, A., Daneshmand, M., eds.: Proc. of the Seventh International Symposium on Computers and Communications, Taormina-Giardini Naxos, Italy (2002) 1040-1045
11. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science 1540 (1999) 398-416
12. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24 (1999) 25-46
13. Zaki, M. J., Hsiao, C. J.: CHARM: An efficient algorithm for closed itemset mining. In Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R., eds.: Proceedings of the Second SIAM International Conference on Data Mining, Arlington VA (2002)