Big Data Frequent Pattern Mining - Frequent Pattern Mining - page 255

53. Takahiko Shintani and Masaru Kitsuregawa. Mining algorithms for sequential patterns in par-
allel: Hash based approach. In Xindong Wu, Kotagiri Ramamohanarao, and Kevin B. Korb,
editors, Pacific-Asia Conference on Knowledge Discovery and Data Mining , volume 1394 of
PAKDD '98 , pages 283-294. Springer, 1998.
54. Ramakrishnan Srikant and Rakesh Agrawal. Mining sequential patterns: Generalizations and
performance improvements. In International Conference on Extending Database Technology:
Advances in Database Technology , EDBT '96, pages 3-17, London, UK, UK, 1996. Springer-
Verlag.
55. Esko Ukkonen. On-line construction of suffix trees. Algorithmica , 14(3):249-260, 1995.
56. Jianyong Wang and Jiawei Han. Bide: Efficient mining of frequent closed sequences. In Inter-
national Conference on Data Engineering , ICDE '04, pages 79-91, Washington, DC, USA,
2004. IEEE Computer Society.
57. Chao Wang and Srinivasan Parthasarathy. Parallel algorithms for mining frequent structural
motifs in scientific data. In Annual International Conference on Supercomputing , ICS '04,
pages 31-40, New York, NY, USA, 2004. ACM.
58. Ke Wang, Yabo Xu, and Jeffrey Xu Yu. Scalable sequential pattern mining for biological
sequences. In International Conference on Information and Knowledge Management , CIKM
'04, pages 178-187, New York, NY, USA, 2004. ACM.
59. Tom White. Hadoop: The Definitive Guide . O'Reilly Media, 2009.
60. Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In IEEE
International Conference on Data Mining , ICDM 2002, pages 721-724. IEEE, 2002.
61. XifengYan, Jiawei Han, and Ramin Afshar. Clospan: Mining closed sequential patterns in large
databases. In Daniel Barbará and Chandrika Kamath, editors, SIAM International Conference
on Data Mining , SDM 2003. SIAM, 2003.
62. Mohammed J. Zaki. Efficient enumeration of frequent sequences. In Seventh International
Conference on Information and Knowledge Management , CIKM '98, pages 68-75, New York,
NY, USA, 1998. ACM.
63. Mohammed J. Zaki.

Scalable algorithms for association mining. IEEE Transactions on

Knowledge and Data Engineering , 12(3):372-390, May 2000.
64. Mohammed J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Machine
Learning , 42(1-2):31-60, January 2001.
65. Mohammed J. Zaki. Parallel sequence mining on shared-memory machines. Journal of Parallel
and Distributed Computing , 61(3):401-426, Mar 2001. Special issue on High Performance
Data Mining.
66. Mohammed J. Zaki, Mitsunori Ogihara, Srinivasan Parthasarathy, and Wei Li. Parallel data
mining for association rules on shared-memory multi-processors. In ACM/IEEE Conference
on Supercomputing , pages 43-43, 1996.
67. Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. Parallel

algorithms for discovery of association rules. Data Mining and Knowledge Discovery ,

1(4):343-373, 1997.