Top-down mining of interesting patterns from very high dimensional data

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 114-

  Liu, Hongyan ^a   Han, Jiawei ^b   Xin, Dong ^b   Shao, Zheng ^b  

^a TSINGHUA UNIVERSITY   (China)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749592722     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.161     Document Type: Conference Paper

References (6)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In. Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), pp. 487-499, Sept. 1994.
2. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD'00), pp. 11-20, Dallas, TX, May 2000.
3. M. Zaki and C. Hsiao. Charm: An efficient algorithm for closed association rule mining. In Proc. of 2002 SIAM Data Mining Conf., 2002.
4. G. Grahne and J. Zhu. Efficiently Using Prefix-trees in Mining Frequent Itemsets. In Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations Melbourne, Florida, Nov., 2003.
5. F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. CARPENTER: Finding closed patterns in long biological datasets. In Proc. 2003 ACM SIGKDD Int. Conf. On Knowledge Discovery and Data Mining, 2003.
6. http://www.sgi.com/tech/mlc/.