maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams
文献类型：会议论文
| 作者 | Wang Yongyan ; Li Kun ; Wang Hongan |
| 出版日期 | 2009 |
| 会议名称 | IEEE Symposium on Computational Intelligence and Data Mining |
| 会议日期 | MAR 30-APR |
| 会议地点 | Nashville, TN |
| 关键词 | Algorithms Artificial intelligence Computational complexity Data communication systems Data mining |
| 英文摘要 | Mining frequent itemsets over online data streams, where the new data arrive and the old data will be removed with high speed, is a challenge for the computational complexity. Existing approximate mining algorithms suffer from explosive computational complexity when decreasing the error parameter, c, which is used to control the mining accuracy. We propose a new approximate mining algorithm using an approximate frequent itemset tree (abbreviated as AFI-tree), called AFI algorithm, to mine approximate frequent itemsets over online data streams. The AFI-tree based on prefix tree maintains only frequent itemsets, so the number of nodes in the tree is very small. All the infrequent child nodes of any frequent node are pruned and the maximal support of the pruned nodes is estimated to detect new frequent itemsets. In order to guarantee the mining accuracy, when the estimated maximal support of the pruned nodes is a bit more than the minimum support, their supports will be re-computed and the frequent nodes among them will be inserted into the AFI-tree. Experimental results show that the AFI algorithm consumes much less memory space than existing algorithms, and runs much faster than existing algorithms in most occasions. |
| 会议主办者 | IEEE |
| 会议录 | 2009 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009 - Proceedings
 |
| 会议录出版者 | 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DATA MINING |
| 会议录出版地 | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN号 | 978-1-4244-2765-9 |
| 源URL | [http://124.16.136.157/handle/311060/8318]  |
| 专题 | 软件研究所_人机交互技术与智能信息处理实验室_会议论文 |
| 推荐引用方式 GB/T 7714 | Wang Yongyan,Li Kun,Wang Hongan. maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams[C]. 见:IEEE Symposium on Computational Intelligence and Data Mining. Nashville, TN. MAR 30-APR. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。