H-mine: Hyper-structure mining of frequent patterns in large databases

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 441-448

  Pei, Jian ^a,b   Han, Jiawei ^b   Lu, Hongjun ^c   Nishio, Shojiro ^d   Tang, Shiwei ^a   Yang, Dongqing ^a  

^a PEKING UNIVERSITY   (China)

^b SIMON FRASER UNIVERSITY   (Canada)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (17)

1. R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and R Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD'98, pages 94-105.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pages 487-499.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD'98, pages 85-93.
5. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining on large, dense data sets. In ICDE'99.
6. J. Han, J. Pei, ana Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD'00, pages 1-12.
7. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In KDD'98, pages 80-86.
8. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In KDD'94, pages 181-192.
9. R. Ng, L. V. S. Lakshmanan, I. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD'98, pages 13-24.
10. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In ICDE'01, pages 433-332.
11. 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), pages 11-20.
12. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE'01, pages 215-224.
13. A. Savasere, t. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In VLDB '95, pages 432-443.
14. R. Srikant ana R. Agrawal. Mining quantitative association rules in large relational tables. In SIGMOD'96, pages 1-12.
15. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In EDBT'96, pages 3-17.
16. K. wang, S. Zhou, and S. C. Liew. Building hierarchical classifiers using class proximity. In VLDB'99, pages 363-374.
17. M. Zaki. Generating non-redundant association rules. In KDD'00, pages 34-43.