Time-Sensitive Stream Pattern Mining under Bounded Memory Constraints
碩士 === 逢甲大學 === 資訊工程所 === 99 === Mining frequent itemsets over data streams is a challenging problem in recent year. The mining in the sliding window model is more desirable since people generally have more interest in the change of recent data. The transaction-sensitive sliding window model conside...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15010926316533204469 |