An Efficient Approach for Mining Frequent Closed Itemsets without Closure Checking
碩士 === 逢甲大學 === 資訊工程所 === 95 === Most existing algorithms for mining frequent closed itemsets have to check whether a new generated itemset is a frequent closed itemset by using the subset checking technique. If we want to do the subset checking, a storing structure is necessary to be built in order...
Main Authors: | Chih-Hsien Lee, 李志賢 |
---|---|
Other Authors: | Don-Lin Yang |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80873004846300860638 |
Similar Items
-
Mining Frequent Closed Itemsets with the Frequent Pattern List
by: Che-Chuan Chen, et al.
Published: (2002) -
An Efficient Algorithm for Mining Closed Frequent Inter-transaction Itemsets
by: Wan-Yu Weng, et al.
Published: (2006) -
Designing Efficient Mining algorithms for Frequent Closed Itemsets Maintenances
by: Cheng-Liang Chiu, et al.
Published: (2005) -
FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining
by: Tianyou Wei, et al.
Published: (2020-01-01) -
Mining dynamic databases for frequent closed itemsets
by: Jing, Jun
Published: (2016)