Mining Frequent Itemsets Using Combinatorial Approximation and Itemset Clustering
博士 === 國立中興大學 === 資訊科學與工程學系 === 96 === Association rule mining (ARM) usually requires a long running time to discover frequent itemsets from databases with a huge number of transactions against low minimum supports. To speed up this task, we propose a new concept based on support approximation (usin...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/78605954880019886654 |