Mining Long Patterns - Frequent Pattern Mining - page 102

16. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In
SIGKDD , pages 647-652, 2004.
17. C. Olston, S. Chopra, and U. Srivastava. Generating example data for dataflow programs. In
SIGMOD , pages 245-256, 2009.
18. F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. Carpenter: finding closed patterns
in long biological datasets. In Lise Getoor, Ted E. Senator, Pedro Domingos, and Christos
Faloutsos , editors, KDD , pages 637-642. ACM, 2003.
19. F. Pan, G. Cong, X. Xin, and A. K. H. Tung. Cobbler: Combining column and row enumeration
for closed pattern discovery. In In Proc 2004 Int. Conf. on Scientific and Statistical Database
Management (SSDBM'04), Santorini Island , pages 21-30, 2004.
20. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets.
In DMKD , pages 11-20, 2000.
21. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. PrefixSpan: Mining
sequential patterns efficiently by prefix-projected pattern growth. In ICDE , pages 215-224,
2001.
22. J. Prins, J. Yang, J. Huan, and W. Wang. Spin: Mining maximal frequent subgraphs from graph
databases. In SIGKDD , pages 581-586, 2004.
23. L. Thomas, S. Valluri, and K. Karlapalem. Margin: Maximal frequent subgraph mining. In
ICDM , pages 1097-1101, 2006.
24. J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed
itemsets. In SIGKDD , pages 236-245, 2003.
25. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM , pages 721-724,
2002.
26. J. Yang, W. Wang, P. S. Yu, and J. Han. Mining long sequential patterns in a noisy environment.
In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data ,
SIGMOD '02, pages 406-417, New York, NY, USA, 2002. ACM.
27. M. J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Mach. Learn. , 42(1-
2):31-60, January 2001.
28. M. Zaki. Efficiently mining frequent trees in a forest. In SIGKDD , pages 71-80, 2002.
29. M. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In SDM ,
pages 457-473, 2002.
30. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of
association rules. In In 3rd Intl. Conf. on Knowledge Discovery and Data Mining , pages 283-
286. AAAI Press, 1997.
31. F. Zhu, X. Yan, J. Han, P. Yu, and H. Cheng. Mining colossal frequent patterns by core pattern
fusion. In ICDE , pages 706-715, 2007.
32. F. Zhu, X. Yan, J. Han, and P. S. Yu. Efficient discovery of frequent approximate sequential
patterns. In ICDM , pages 751-756, 2007.
33. F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, and P. S. Yu. Mining top-k large structural patterns in a
massive network. PVLDB , 4(11):807-818, 2011.