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

47. Carson Kai-Sang Leung and Fan Jiang. Frequent itemset mining of uncertain data streams
using the damped window model. In Proceedings of the 2011 ACM Symposium on Applied
Computing , SAC '11, pages 950-955, New York, NY, USA, 2011. ACM.
48. Carson Kai-Sang Leung and Fan Jiang. Frequent pattern mining from time-fading streams of
uncertain data. In Data Warehousing and Knowledge Discovery , pages 252-264. Springer,
2011.
49. Hua-Fu Li and Suh-Yin Lee. Mining frequent itemsets over data streams using efficient window
sliding techniques. Expert Systems with Applications , 36(2):1466-1477, 2009.
50. Haifeng Li and Ning Zhang. A false negative maximal frequent itemset mining algorithm over
stream. In Advanced Data Mining and Applications , pages 29-41. Springer, 2011.
51. Wenmin Li, Jiawei Han, and Jian Pei. Cmar: Accurate and efficient classification based on
multiple class-association rules. In Proceedings of the 2001 IEEE International Conference
on Data Mining , ICDM '01, pages 369-376, Washington, DC, USA, 2001. IEEE Computer
Society.
52. Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. An efficient algorithm for mining frequent
itemsets over the entire history of data streams. In Proc. of First International Workshop on
Knowledge Discovery in Data Streams , 2004.
53. Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Online mining (recently) maximal frequent
itemsets over data streams. In Research Issues in Data Engineering: Stream Data Mining and
Applications, 2005. RIDE-SDMA 2005. 15th International Workshop on, pages 11-18. IEEE,
2005.
54. Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Online mining of frequent query trees over
xml data streams. In Proceedings of the 15th international conference on World Wide Web ,
pages 959-960. ACM, 2006.
55. Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Dsm-fi: an efficient algorithm for mining
frequent itemsets in data streams. Knowledge and Information Systems , 17(1):79-97, 2008.
56. Hua-Fu Li, Chin-Chuan Ho, and Suh-Yin Lee. Incremental updates of closed frequent itemsets
over continuous data streams. Expert Systems with Applications , 36(2):2451-2458, 2009.
57. Haifeng Li, Ning Zhang, and Zhixin Chen. A simple but effective maximal frequent itemset
mining algorithm over streams. Journal of Software , 7(1):25-32, 2012.
58. Chih-Hsiang Lin, Ding-Ying Chiu, Yi-Hung Wu, and Arbee L.P. Chen. Mining frequent item-
sets from data streams with a time-sensitive sliding window. In Proceedings of the Fifth SIAM
International Conference on Data Mining , volume 119, page 68. SIAM, 2005.
59. Xuejun Liu, Jihong Guan, and Ping Hu. Mining frequent closed itemsets from a landmark
window over online data streams. Comput. Math. Appl. , 57(6):927-936, March 2009.
60. G. S. Manku and R. Motwani. Approximate Frequency Counts Over Data Streams. In
Proceedings of Conference on Very Large DataBases (VLDB) , pages 346-357, September
2002.
61. Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams.
In Proceedings of the 28th international conference on Very Large Data Bases , VLDB '02,
pages 346-357. VLDB Endowment, 2002.
62. Alice Marascu and Florent Masseglia. Mining sequential patterns from data streams: A centroid
approach. J. Intell. Inf. Syst. , 27(3):291-307, November 2006.
63. Guojun Mao, Xindong Wu, Xingquan Zhu, Gong Chen, and Chunnian Liu. Mining maximal
frequent itemsets from data streams. Journal of Information Science , 33(3):251-262, 2007.
64. Luiz F. Mendes, Bolin Ding, and Jiawei Han. Stream sequential pattern mining with precise
error bounds. In Proceedings of the 2008 Eighth IEEE International Conference on Data
Mining , ICDM '08, pages 941-946, Washington, DC, USA, 2008. IEEE Computer Society.
65. Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent
and top-k elements in data streams. In Proceedings of the 10th International Conference on
Database Theory , ICDT'05, pages 398-412, Berlin, Heidelberg, 2005. Springer-Verlag.
66. Jayadev Misra and David Gries. Finding repeated elements. Technical report, Cornell

University, Ithaca, NY, USA, 1982.