A Fast Algorithm for Mining Closed Frequent Itemsets without Candidate Generation
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 101 === Closed frequent itemsets mining has been widely studied in data mining research. Since association rules mining proposed, frequent itemsets mining became an important research issue. The problem of frequent itemsets mining is that the memory consumption is too...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42325633621254649519 |