LPMiner: An algorithm for finding frequent itemsets using length-decreasing support constraint

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 505-512

  Seno, Masakazu ^a   Karypis, George ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (8)

1. R. Agarwal, C. Aggarwal, V. Prasad, and V. Crestana. A tree projection algorithm for generation of large itemsets for association rules. IBM Research Report, RC21341, November 1998.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Int'l Conference on Very Large Databases, Santiago, Chile, September 1994.
3. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. In ICDE, pages 489-499, 2000.
4. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), pages 1-12, Dallas, TX, May 2000.
5. B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. In SIGKDD 1999, 1999.
6. K. Wang, Y. He, and J. Han. Mining frequent itemsets using support constraints. In The VLDB Journal, pages 43-52, 2000.
7. M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372-390, May/June 2000.
8. M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. Technical Report 01-1, RPI, 2001.