An Efficient Closure-Based Method for Discovering Maximal Frequent Itemsets
碩士 === 逢甲大學 === 資訊工程所 === 91 === Regarding existing algorithms for mining association rules, there are still many problems associated with database scan. Some of those algorithms (e.g., Apriori) may require too many times of database scan, especially when maximum frequent itemsets are too long (long...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/burzr2 |