Multi-level frequent pattern mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 369-383

  Eavis, Todd ^a   Zheng, Xi ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; BOTTOM UP APPROACH; BROAD SPECTRUM; CONCEPT LEVELS; DATA SETS; FP-TREE STRUCTURE; FREQUENT PATTERN MINING; FREQUENT PATTERNS; MULTI-LEVEL; NOVEL ALGORITHM; RESEARCH AREAS; TEST ENVIRONMENT;

ALGORITHMS; MINING;

DATABASE SYSTEMS;

EID: 67650155503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_33     Document Type: Conference Paper

References (15)

1. Agrawal, R., Srikant, R.: Fast algorithm for mining association rules in large databases. In: VLDB, pp. 487-499 (1994)
2. Aumann, Y., Lindell, Y.: A statistical theory for quantitative association rules. In: ACM SIGKDD, pp. 261-270 (1999)
3. Grahne, G., Lakshmanan, L.V.S., Wang, X.: Efficient mining of constrained correlated sets. In: ICDE, pp. 512-521 (2000) (Pubitemid 30585717)
4. Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using fp-trees. IEEE Transactions on Knowledge and Data Engineering 17(10) (2005)
5. Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In: VLDB, pp. 420-431 (1995)
6. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD, pp. 1-12 (2000)
7. Liu, J., Paulsen, S., Sun, X., Wang, W., Nobel, A., Prins, J.: Mining approximate frequent itemsets in the presence of noise. In: SIAM international conference on data mining (2006)
8. Miller, R.J., Yang, Y.: Association rules over interval data. In: ACM SlGMOD, pp. 452-461 (1997) (Pubitemid 127456806)
9. Pan, F., Cong, G., Tung, A.K.H., Yang, J., Zaki, M.: Carpenter: Finding closed patterns in long biological datasets. In: ACM SIGKDD, pp. 637-646 (2003)
10. Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: ICDE, pp. 433-442 (2001) (Pubitemid 32457145)
11. Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: Mining sequential patterns by pattern-growth: the pre.xspan approach. In: Transactions on Knowledge Data Engineering, pp. 1424-1440 (2004) (Pubitemid 40242330)
12. Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: ACM SlGMOD, pp. 1-12 (1996) (Pubitemid 126440751)
13. Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3-17. Springer, Heidelberg (1996)
14. Zhang, H., Padmanabhan, B., Tuzhilin, A.: On the discovery of signi.cant statistical quantitative rules. In: SIGKDD, pp. 374-383 (2004) (Pubitemid 40114947)
15. Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining colossal frequent patterns by core pattern fusion. In: ICDE, pp. 706-715 (2007) (Pubitemid 47422074)