GRG: An Efficient Method for Association Rules Mining on Frequent Closed Itemsets

IEEE International Symposium on Intelligent Control - Proceedings

Volumn , Issue , 2003, Pages 854-859

  Li, Li ^a   Zhai, Donghai ^a   Jin, Fan ^a  

^a SOUTHWEST JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; GRAPH THEORY;

FREQUENT CLOSED ITEMSETS;

DATA MINING;

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

References (7)

1. R.Agrawl and R.Srikant. Fast Algorithm for Mining Association Rules. In Proc 1994 Int. Conf. Very Large Data Base, In VLDB'94, page 487-499, Santiago, Chile, September 1994.
2. S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing association rules to correlations. In SIGMOD'97, page 265-276, 1997
3. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In Proc. AAAI'94 Workshop Knowledge Discovery in Database (KDD'94), pages 181-192, seattle, WA July 1994.
4. J.Han, G.Dong, and Y.Yin. Efficient mining of partial periodic patterns in time series database. In Proc. 1999 int.Conf. Data Engineering (ICDE'99), page) 106-115, Sydney, Australia, April 1999.
5. H.Mannila, H Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, page 259-289, 1997.
6. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory, page 398-416, 1999
7. J.Pei, J.Han, and R.Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In SIGMOD International Workshop on Data Mining and Knowledge Discovery, May 2000.