An Efficient Algorithm for Mining Closed Frequent Inter-transaction Itemsets
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 94 === Many algorithms have been proposed recently for finding inter-transaction association rules, which represent the relationships among itemsets across different transactions. Since numerous frequent inter-transaction itemsets will be generated, mining closed frequ...
Main Authors: | Wan-Yu Weng, 翁婉玉 |
---|---|
Other Authors: | 李瑞庭 |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/08660486300100000909 |
Similar Items
-
Mining Frequent Itemsets by Transaction Decomposition with Itemset Clustering
by: Hong-Bin Chen, et al.
Published: (2009) -
Designing Efficient Mining algorithms for Frequent Closed Itemsets Maintenances
by: Cheng-Liang Chiu, et al.
Published: (2005) -
Efficient Frequent Closed Itemset Algorithms With Applications To Stream Mining And Classification
by: Ranganath, B N
Published: (2010) -
An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams
by: Wei-hau Peng, et al.
Published: (2009) -
Mining Frequent Closed Itemsets with the Frequent Pattern List
by: Che-Chuan Chen, et al.
Published: (2002)