Frequent Pattern Mining in Data Streams - Frequent Pattern Mining - page 220

67. Willie Ng and Manoranjan Dash. Efficient approximate mining of frequent patterns over
transactional data streams. In Proceedings of the 10th international conference on Data Ware-
housing and Knowledge Discovery , DaWaK '08, pages 241-250, Berlin, Heidelberg, 2008.
Springer-Verlag.
68. Debprakash Patnaik, Srivatsan Laxman, Badrish Chandramouli, and Naren Ramakrishnan. A
general streaming algorithm for pattern discovery. Knowledge and Information Systems , pages
1-26, 2013.
69. Chedy Raïssi, Pascal Poncelet, and Maguelonne Teisseire. Need for SPEED: Mining sequential
patterns in data streams. BDA'05: Bases de données Avanées Actes, 2005.
70. Chedy Raïssi, Pascal Poncelet, and Maguelonne Teisseire. Towards a new approach for mining
frequent itemsets on data stream. Journal of Intelligent Information Systems , 28(1):23-36,
2007.
71. Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, and Young-Koo
Lee. Sliding window-based frequent pattern mining over data streams. Information sciences ,
179(22):3843-3865, 2009.
72. Wei-Guang Teng, Ming-Syan Chen, and Philip S. Yu. A regression-based temporal pattern
mining scheme for data streams. In Proceedings of the 29th international conference on Very
large data bases-Volume 29 , VLDB '03, pages 93-104. VLDB Endowment, 2003.
73. H. Toivonen. Sampling large databases for association rules. In Proc. of the 22nd VLDM
Conference. , 1996.
74. Raymond Chi-Wing Wong and Ada Wai-Chee Fu. Mining top-k frequent itemsets from data
streams. Data Mining and Knowledge Discovery , 13(2):193-217, 2006.
75. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern
sets. In VLDB , 2005.
76. Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In ICDM '02:
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02) , page
721, 2002.
77. Jeffery Xu Yu, Zhihong Chong, Hongjun Lu, and Aoying Zhou.Li False positive or false
negative: mining frequent itemsets from high speed transactional data streams. In Proceedings
of the Thirtieth international conference on Very large data bases-Volume 30 , VLDB '04, pages
204-215. VLDB Endowment, 2004.
78. Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In KDD '02: Proceedings of
the eighth ACM SIGKDD international conference on Knowledge discovery and data mining ,
pages 71-80, 2002.
79. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of
association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining. , August 1997.
80. Mohammed J. Zaki and Charu C. Aggarwal. Xrules: an effective structural classifier for
xml data. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference
on Knowledge discovery and data mining , pages 316-325, 2003.