An Efficient Hash-Based Method for Discovering the Maximal Frequent Set
碩士 === 逢甲大學 === 資訊工程學系 === 89 === The association rule mining can be divided into two steps. The first step is to find out all frequent itemsets, whose occurrences are greater than or equal to the user-specified threshold. The second step is to generate reliable association rules based o...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78966617015017084764 |