Mining traditional association rules using frequent itemsets lattice

2009 International Conference on Computers and Industrial Engineering, CIE 2009

Volumn , Issue , 2009, Pages 1401-1406

  Vo, Bay ^a   Le, Bac ^a  

^a HO CHI MINH CITY UNIVERSITY OF TECHNOLOGY   (Viet Nam)

Author keywords

Association rules; Frequent itemsets; Frequent itemsets lattice; Hash table

Indexed keywords

DATA MINING; DATA STRUCTURES;

HASH TABLE; ITEM SETS; MINING ASSOCIATIONS; MINING FREQUENT ITEMSETS;

ASSOCIATION RULES;

EID: 77956115941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccie.2009.5223866     Document Type: Conference Paper

References (17)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules betweensets of items in large databases, Proceedings of the 1993 ACM SIGMOD ConferenceWashington DC, USA, May 1993, pp. 207-216 (1993).
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, InVLDB'94, pp. 487-499 (1994).
3. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, L. Lakhal, Mining MinimalNon-Redundant Association Rules using Closed Frequent Itemsets, In 1stInternational Conference on Computational Logic, pp. 972-986 (2000).
4. R. J. Bayardo, R. Agrawal, Mining the Most Interesting Rules, Proc. ofFifth ACM SIGKDD pp. 145-154(1999).
5. V. Choi, Faster Algorithms for Constructing a Concept (Galois) Lattice,arXiv:cs.DM/0602069 (2006).
6. G. Grahne and J. Zhu, Efficiently Using Prefix-trees in Mining FrequentItemsets, In FIMIO3 Workshop on Frequent Itemset Mining Implementations (2003).
7. G. Grahne, J. Zhu, High Performance Mining of Maximal Frequent Itemsets,In 6th International Workshop on High Performance Data Mining (2003).
8. J. Han, M. Kamber, Data Mining: Concept and Techniques, Morgan KaufmannPublishers, second edition, pp. 239-241 (2006).
9. http://fimi.cs.helsinki.fi/data/ (download on april 2005)
10. S. O. Kuznetsov, S. A. Obiedkov, Comparing performance of algorithms forgenerating concept lattices, J. Exp. Theor. Artif. Intell. 14(2-3), pp.189-216(2002).
11. J. Li, On Optimal Rule Discovery, IEEE Transactions on Knowledge and DataEngineering, Vol.18, No.4, April 2006, pp. 460-471 (2006).
12. K. McGarry, A Survey of Interestingness Measures for Knowledge Discovery,In Knowledge Engeneering Review, Cambridge University Press, pp. 1-24(2005).
13. J. Wang, J. Han and J. Pei, CLOSET+: Searching for the Best Strategiesfor Mining Frequent Closed Itemsets, In ACM SIGKDD International Conference onKnowledge Discovery and Data Mining, pp. 236-245 (2003).
14. Y. Yao, Y. Chen, X. Yang, A Measurement-Theoretic Foundation of RuleInteresting Evaluation, Studies in Computational Intelligence (Book chapter),Volume 9, pp. 41-59 (2006).
15. M. J. Zaki, C.J. Hsiao, Efficient Algorithms for Mining Closed Itemsetsand Their Lattice Structure, IEEE Transactions on Knowledge and DataEngineering, Vol.17, No 4, April 2005, pp. 462-478 (2005).
16. M. J. Zaki, Mining Non-Redundant Association Rules, Data Mining andKnowledge Discovery 9, Kluwer Academic Publishers. Manufactured in TheNetherlands, pp. 223-248 (2004).
17. M. J. Zaki and K. Gouda, Fast Vertical Mining Using Diffsets, Proc. NinthACM SIGKDD IntT Conf. Knowledge Discovery and Data Mining, Aug. 2003, pp.326-335 (2003).