Interactive Mining of Frequent Itemsets in Data Streams
碩士 === 逢甲大學 === 資訊工程所 === 96 === Mining frequent patterns in a data stream is very challenging for the high complexity of continuous exploration of unbounded data with bounded memory. Previous approaches usually assume a fixed minimum support and an unchangeable time interval in mining frequent item...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56236349203486602443 |