Sequential Pattern Mining - Frequent Pattern Mining - page 277

20. B. A. Davey and H. A. Priestley, Eds., Introduction to lattices and order . Cambridge: Cambridge
University Press, 1990.
21. M. J. Zaki and C. jui Hsiao, “Charm: An efficient algorithm for closed itemset mining,” in
SDM Conference , 2002, pp. 457-473.
22. J. Pei, J. Han, and R. Mao, “Closet: An efficient algorithm for mining frequent closed itemsets,”
in ACM SIGMOD Workshop , 2000, pp. 21-30.
23. J. Wang, J. Han, and J. Pei, “Closet+: searching for the best strategies for mining frequent
closed itemsets,” in ACM SIGKDD Conference , 2003, pp. 236-245.
24. F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki, “Carpenter: finding closed patterns in
long biological datasets,” in ACM SIGKDD Conference , 2003, pp. 637-642.
25. X. Yan, J. Han, and R. Afshar, “Clospan: Mining closed sequential patterns in large datasets,”
in SDM Conference , 2003, pp. 166-177.
26. J. Wang and J. Han, “Bide: Efficient mining of frequent closed sequences,” in ICDE Conference ,
2004.
27. J. Wang, J. Han, and C. Li, “Frequent closed sequence mining without candidate maintenance,”
TKDE , vol. 19, no. 8, pp. 1042-1056, 2007.
28. C. Li, Q. Yang, J. Wang, and M. Li, “Efficient mining of gap-constrained subsequences and
its various applications,” ACM Trans. Knowl. Discov. Data , vol. 6, no. 1, pp. 2:1-2:39, Mar.
2012.
29. J. Wang, Y. Zhang, L. Zhou, G. Karypis, and C. C. Aggarwal, “Contour: An efficient algorithm
for discovering discriminating subsequences,” Data Min. Knowl. Discov. , vol. 18, no. 1, pp. 1-
29, Feb. 2009.
30. H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen, and U. Dayal, “Multi-dimensional sequential
pattern mining,” in CIKM Conference , 2001, pp. 81-88.
31. C.-C. Yu and Y.-L. Chen, “Mining sequential patterns from multidimensional sequence data,”
IEEE Trans. on Knowl. and Data Eng. , vol. 17, no. 1, pp. 136-140, Jan. 2005.
32. S. Parthasarathy, M. J. Zaki, M. Ogihara, and S. Dwarkadas, “Incremental and interactive
sequence mining,” in CIKM Conference , 1999, pp. 251-258.
33. F. Masseglia, P. Poncelet, and M. Teisseire, “Incremental mining of sequential patterns in large
databases,” Data Knowl. Eng. , vol. 46, no. 1, pp. 97-121, 2003.
34. H. Cheng, X. Yan, and J. Han, “Incspan: incremental mining of sequential patterns in large
database,” in ACM SIGKDD Conference , 2004, pp. 527-532.
35. C. Gao, J. Wang, and Q. Yang, “Efficient mining of closed sequential patterns on stream sliding
window,” in ICDM Conference , 2011.
36. D.-Y. Chiu, Y.-H. Wu, and A. L. P. Chen, “An efficient algorithm for mining frequent sequences
by a new strategy without support counting,” in ICDE Conference , 2004, pp. 375-386.
37. H. Kum, J. Pei, W. Wang, and D. Duncan, “Approxmap: Approximate mining of consensus
sequential patterns,” in SDM Conference , 2002.
38. P. Tzvetkov, X. Yan, and J. Han, “Tsp: Mining top-k closed sequential patterns,” in ICDM
Conference , 2003.
39. H. Mannila, H. Toivonen, and A. I. Verkamo, “Discovering frequent episodes in sequences,”
in KDD Conference , 1995, pp. 210-215.
40. N. Tatti and B. Cule, “Mining closed strict episodes,” in ICDM Conference , 2010, pp. 501-510.
41. N. Tatti and B. Cule, “Mining closed strict episodes,” Data Min. Knowl. Discov. , vol. 25, no.
1, pp. 34-66, Jul. 2012.