1 An Efficient Algorithm for M ining Frequent Itemests over the Entire History of D ata Streams Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Accep Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Accep ted for publication in the Proceedings of First ted for publication in the Proceedings of First International Workshop on Knowledge Discovery in International Workshop on Knowledge Discovery in Data Streams, to be held in conjunction with the Data Streams, to be held in conjunction with the 15th European Conference on Machine Learning (EC 15th European Conference on Machine Learning (EC ML 2004). ML 2004). Adviser: Jia-Ling Koh Adviser: Jia-Ling Koh Speaker: Shu-Ning Shin Speaker: Shu-Ning Shin Date: 2005.3.4 Date: 2005.3.4
18
Embed
An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams
An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams. - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
1
An Efficient Algorithm for Mining Frequent Itemestsover the Entire History of Data Streams
Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Accepted for Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Accepted for publication in the Proceedings of First International Workspublication in the Proceedings of First International Workshop on Knowledge Discovery in Data Streams, to be held in hop on Knowledge Discovery in Data Streams, to be held in conjunction with the 15th European Conference on Machinconjunction with the 15th European Conference on Machine Learning (ECML 2004).e Learning (ECML 2004).