| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Chen, Arbee L. P. | en_US |
| dc.creator (作者) | Wang, En Tzu | en_US |
| dc.date (日期) | 2011.06 | en_US |
| dc.date.accessioned | 25-Jun-2014 16:11:51 (UTC+8) | - |
| dc.date.available | 25-Jun-2014 16:11:51 (UTC+8) | - |
| dc.date.issued (上傳時間) | 25-Jun-2014 16:11:51 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/66912 | - |
| dc.description.abstract (摘要) | Mining frequent itemsets over data streams has attracted much research attention in recent years. In the past, we had developed a hash-based approach for mining frequent itemsets over a single data stream. In this paper, we extend that approach to mine global frequent itemsets from a collection of data streams distributed at distinct remote sites. To speed up the mining process, we make the first attempt to address a new problem on continuously maintaining a global synopsis for the union of all the distributed streams. The mining results therefore can be yielded on demand by directly processing the maintained global synopsis. Instead of collecting and processing all the data in a central server, which may waste the computation resources of remote sites, distributed computations over the data streams are performed. A distributed computation framework is proposed in this paper, including two communication strategies and one merging operation. These communication strategies are designed according to an accuracy guarantee of the mining results, determining when and what the remote sites should transmit to the central server (named coordinator). On the other hand, the merging operation is exploited to merge the information received from the remote sites into the global synopsis maintained at the coordinator. By the strategies and operation, the goal of continuously maintaining the global synopsis can be achieved. Rooted in the continuously maintained global synopsis, we propose a mining algorithm for finding global frequent itemsets. Moreover, the correctness guarantees of the communication strategies and merging operation, and the accuracy guarantee analysis of the mining algorithm are provided. Finally, a series of experiments on synthetic datasets and a real dataset are performed to show the effectiveness and efficiency of the distributed computation framework. | en_US |
| dc.format.extent | 3300929 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Data Mining and Knowledge Discovery, 23(2), 252-299 | en_US |
| dc.source.uri (資料來源) | http://dx.doi.org/10.1007/s10618-010-0204-8 | - |
| dc.subject (關鍵詞) | Distributed data streams;Data mining;Frequent itemset;Continuous distributed model;Hash-based approach | en_US |
| dc.title (題名) | Mining Frequent Itemsets over Distributed Data Streams by Continuously Maintaining a Global Synopsis | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s10618-010-0204-8 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/s10618-010-0204-8 | en_US |
