| dc.creator (作者) | C.H. Lin;D.Y. Chiu;Y.H. Wu;陳良弼 | en_US |
| dc.date (日期) | 2005 | en_US |
| dc.date.accessioned | 9-Jan-2009 16:52:11 (UTC+8) | - |
| dc.date.available | 9-Jan-2009 16:52:11 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Jan-2009 16:52:11 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/23903 | - |
| dc.description.abstract (摘要) | Mining frequent itemsets has been widely studied over the last decade. Past research focuses on mining frequent itemsets from static databases. In many of the new applications, data flow through the Internet or sensor networks. It is challenging to extend the mining techniques to such a dynamic environment. The main challenges include a quick response to the continuous request, a compact summary of the data stream, and a mechanism that adapts to the limited resources. In this paper, we develop a novel approach for mining frequent itemsets from data streams based on a time-sensitive sliding window model. Our approach consists of a storage structure that captures all possible frequent itemsets and a table providing approximate counts of the expired data items, whose size can be adjusted by the available storage space. Experiment results show that in our approach both the execution time and the storage space remain small under various parameter settings. In addition, our approach guarantees no false alarm or no false dismissal to the results yielded. | - |
| dc.format | application/pdf | en_US |
| dc.format.extent | 375426 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Proc. SIAM International Conference on Data Mining | en_US |
| dc.title (題名) | Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window | en_US |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1137/1.9781611972757.7 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1137/1.9781611972757.7 | - |
