An Efficient Approach for Mining Frequent Closed Itemsets without Closure Checking
碩士 === 逢甲大學 === 資訊工程所 === 95 === Most existing algorithms for mining frequent closed itemsets have to check whether a new generated itemset is a frequent closed itemset by using the subset checking technique. If we want to do the subset checking, a storing structure is necessary to be built in order...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/80873004846300860638 |