Discovering the Maximum Frequent Set Base on Boolean Method
碩士 === 立德管理學院 === 應用資訊研究所 === 91 === Find out frequent itemsets from large data set is a main problem in data mining area, such as the discovery of association rule. We examine the problem of discovering association rules between items in a large database of sales transactions. In this thesis, we pr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48714814584012932044 |