A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams
碩士 === 國立中山大學 === 資訊工程學系研究所 === 99 === Online mining the maximal frequent itemsets over data streams is an important problem in data mining. The maximal frequent itemset is the itemset which the support is large or equal to the minimal support and the itemset is not the subset or superse of each ite...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22045887069370251404 |