H-Mine: Fast and space-preserving frequent pattern mining in a large databases

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 6, 2007, Pages 593-605

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

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

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

^d OSAKA UNIVERSITY   (Japan)

^e PEKING UNIVERSITY   (China)

Author keywords

FP tree; Frequent pattern mining; Transaction databases

Indexed keywords

CACHE MEMORY; DATA STRUCTURES; DATABASE SYSTEMS;

DATABASE PARTITIONING; PATTERN MINING; SPACE-PRESERVING MINING;

DATA MINING;

EID: 33947659968     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600897460     Document Type: Article

References (19)

1. Agarwal, R. C. Agarwal, C. C. and Prasad, V. V. V. (2000) Depth first generation of long patterns. Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ACM Press, pp. 108-118. ACM Press, Boston, MA
2. Agarwal, R. C. Agarwal, C. C. and Prasad, V. V. V. (2001) A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing, 61:3, pp. 350-371.
3. Agrawal, R. Gehrke, J. Gunopulos, D. and Raghavan, P. (1998) Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of the 1998 ACM-SIGMOD International Conference on the Management of Data (SIGMOD1998) Seattle, WApp. 94-105.
4. Agrawal, R. Imielinski, T. and Swami, A. (1993) Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM-SIGMOD International Conference on the Management of Data (SIGMOD1993) Washington, DC pp. 207-216.
5. Agrawal, R. and Srikant, R. (1994) Fast algorithms for mining association rules. Proceedings of the 1994 International Conference on Very Large Data Bases (VLDB1994) Santiago de Chile, Chilepp. 487-499.
6. Agrawal, R. and Srikant, R. (1995) Mining sequential patterns. Proceedings of the 1995 International Conference on the Data Engineering (ICDE1995), pp. 3-14.
7. Bayardo, R. J. (1998) Efficiently mining long patterns from databases. Proceedings of the 1998 ACM- SIGMOD International Conference on the Management of Data (SIGMOD1998) Seattle, WApp. 85-93.
8. Bayardo, R. J. Agrawal, R. and Gunopulos, D. (1999) Constraint-based rule mining on large, dense data sets. Proceedings of the 1999 International Conference on the Data Engineering (ICDE1999) Sydney, Australiapp. 188-197.
9. Brin, S. Motwani, R. and Silverstein, C. (1997) Beyond market basket: Generalizing association rules to correlations. Proceedings of the 1997 ACM-SIGMOD International Conference on the Management of Data (SIGMOD1997) Tucson, AZ pp. 265-276.
10. Dong, G. and Li, J. (1999) Efficient mining of emerging patterns: discovering trends and differences. Proceedings of the 1999 International Conference on Knowledge Discovery and Data Mining (KDD1999) San Diego, CA pp. 43-52.
11. Han, J. Dong, G. and Yin, Y. (1999) Efficient mining of partial periodic patterns in time series database. Proceedings of the 1999 International Conference on Data Engineering (ICDE1999) Sydney, Australia pp. 106-115.
12. Han, J. Pei, J. and Yin, Y. (2000) Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM-SIGMOD International Conference on the Management of Data (SIGMOD1900) Dallas, TX pp. 1-12.
13. Kamber, M. Han, J. and Chiang, J. Y. (1997) Metarule-guided mining of multi-dimensional association rules using data cubes. Proceedings of the 1997 International Conference on Knowledge Discovery and Data Mining (KDD1997) Newport Beach, CA pp. 207-210.
14. Liu, B. Hsu, W. and Ma, Y. (1998) Integrating classication and association rule mining. Proceedings of the 1998 International Conference on Knowledge Discovery and Data Mining (KDD1998) New York, NY pp. 80-86.
15. Mannila, H., Toivonen, H. and Verkamo, A. I. (1997) Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1, pp. 259-289.
16. Pasquier, N. Bastide, Y. Taouil, R. and Lakhal, L. (1999) Discovering frequent closed itemsets for association rules. Proceedings of the 7th International Conference on Database Theory (ICDT1999) Jerusalem, Israel pp. 398-416.
17. Pei, J. Han, J. and Mao, R. (2000) CLOSET: An efficient algorithm for mining frequent closed itemsets. Proceedings of the 2000 ACM-SIGMOD International Workshop on Data Mining and Knowledge Discovery (DMKD1900) Dallas, TX pp. 11-20.
18. Savasere, A. Omiecinski, E. and Navathe, S. (1995) An efficient algorithm for mining association rules in large databases. Proceedings of the 1995 International Conference on Very Large Data Bases (VLDB1995) Zurich, Switzerland pp. 432-443.
19. Silverstein, C., Brin, S., Motwani, R. and Ullman, J. (1998) Scalable techniques for mining causal structures. Proceedings of the 1998 International Conference on Very Large Data Bases (VLDB1998) New York, NY pp. 594-605.