Extracting minimal non-redundant association rules from QCIL

Proceedings - The Fourth International Conference on Computer and Information Technology (CIT 2004)

Volumn , Issue , 2004, Pages 986-991

  Li, Yun ^a   Liu, Zong Tian ^a   Chen, Ling ^b   Cheng, Wei ^b   Xie, Cui Hua ^b  

^a SHANGHAI UNIVERSITY   (China)

^b YANGZHOU UNIVERSITY   (China)

Author keywords

Association rule; Frequent closed itemset; Minimal non redundant rule; Quantitative closed itemset lattice

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASSOCIATIVE PROCESSING; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION ANALYSIS; LATTICE CONSTANTS; LOGIC PROGRAMMING; SET THEORY;

ASSOCIATION RULES; FREQUENT CLOSED ITEMSET; MINIMAL NON-REDUNDANT RULES; QUANTITATIVE CLOSED ITEMSET LATTICE; ASSOCIATION RULE; FREQUENT CLOSED ITEMSETS; MINIMAL NON-REDUNDANT RULE; QUANTITATIVE CLOSED ITEMSET LATTICES;

EXTRACTION; DATA MINING;

EID: 9744261781     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Han J.,Kamber M.Data Mining: Concepts and Techniques.Morgan Kaufmann Publisher,2000
2. Petko Valtchev, Rokia Missaoui, Robert Godin, Mohamed Meridji.Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory. Journal of Experimental and Theoretical Artificial Intelligence 14(2-3) , Taylor & Francis,Binghamton, 2002,pp.115-142.
3. N.Pasquier.Y.Bastide et al. Efficient Mining of Association Rules Using Closed Itemset Lattices.Information Systems,24(1) ,Elsevier,Great Britain, 1999,pp.25-46.
4. M.J.ZaKi.generating Non-Redundant Association Rules. In proceedings of the 6th international Conference on Knowledge Discovery and Data Mining, Springer-Verlag,Berlin, 2000, pp.24-43
5. B.Ganter, R.Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag,Berlin, 1999.
6. M.J.ZaKi, C.J.Hsiao.CHARM:An Efficieent algorithm for Closed Association Rule Mining. Technical report 99-10,Rensselaer Polytechnic, 1999.
7. J.Pei,J.Ha and R.Mao.CLOSET:An Efficient Algorithm for Mining Frequent Closed Itemsets. In proceedings of the ACM SIGMOD workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas,2000,pp.21-30
8. Y.Bastide, N.Pasquier et al. Mining Minimal Non-Redundant Association Rules using Frequent Closed Itemsets.Lecture Notes in Computer Science,vol 1861, Springer-Verlag,Berlin,2000,pp.972-986,.
9. Xie Zhi-peng,Liu Zong-tian.Concept Lattice and Association Rule Discovery Journal of Computer Research and Development, Vol 37,No.12, Beijing,2000,pp.1415-1421(in Chinese).