| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Wang ,En Tzu;Chen,Arbee L. P. | - |
| dc.date (日期) | 2009.08 | en_US |
| dc.date.accessioned | 11-十一月-2013 16:28:52 (UTC+8) | - |
| dc.date.available | 11-十一月-2013 16:28:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-十一月-2013 16:28:52 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/61587 | - |
| dc.description.abstract (摘要) | In recent times, data are generated as a form of continuous data streams in many applications. Since handling data streams is necessary and discovering knowledge behind data streams can often yield substantial benefits, mining over data streams has become one of the most important issues. Many approaches for mining frequent itemsets over data streams have been proposed. These approaches often consist of two procedures including continuously maintaining synopses for data streams and finding frequent itemsets from the synopses. However, most of the approaches assume that the synopses of data streams can be saved in memory and ignore the fact that the information of the non-frequent itemsets kept in the synopses may cause memory utilization to be significantly degraded. In this paper, we consider compressing the information of all the itemsets into a structure with a fixed size using a hash-based technique. This hash-based approach skillfully summarizes the information of the whole data stream by using a hash table, provides a novel technique to estimate the support counts of the non-frequent itemsets, and keeps only the frequent itemsets for speeding up the mining process. Therefore, the goal of optimizing memory space utilization can be achieved. The correctness guarantee, error analysis, and parameter setting of this approach are presented and a series of experiments is performed to show the effectiveness and the efficiency of this approach. | en_US |
| dc.format.extent | 3064318 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Data Mining and Knowledge Discovery, 19(1) , 132-172 | en_US |
| dc.subject (關鍵詞) | Data stream;Data mining;Frequent itemset;Hash-based approach;False positive | - |
| dc.title (題名) | A Novel Hash-based Approach for Mining Frequent Itemsets over Data Streams Requiring Less Memory Space | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s10618-009-0129-2 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/s10618-009-0129-2 | en_US |
