Searching Maximal Frequent Itemsets using Random Two-Way Pruning
碩士 === 南台科技大學 === 資訊管理系 === 92 === We propose two novel approaches for searching maximal frequent itemsets. They applied the concepts of genetic algorithm and random pruning on searching maximal frequent itemsets from transaction databases. The natures of these two algorithms make it possible to loc...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90895980239900776702 |