Efficient Mining of Association Rules From Merged Itemsets
碩士 === 逢甲大學 === 資訊工程所 === 91 === Mining for association rules between items in a large database of sales transactions has been widely investigated recently. In this thesis we use three kinds of data preprocess methods to merge itemsets in a database and present an algorithm to mine association rules...
Main Authors: | Shi-Qin Weng, 翁世親 |
---|---|
Other Authors: | Dong-Lin Yang |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/r3e978 |
Similar Items
-
An Improvement on Mining Association Rules Using Efficient Categorization of Large Itemsets
by: Shi Ming Tsai, et al. -
An Efficient Algorithm for Mining Frequent Itemsets of Association Rules
by: 楊文昇
Published: (2001) -
Efficient Support Counting of Candidate Itemsets for Association Rule Mining
by: Hsin-wei Lin, et al.
Published: (2006) -
An Efficient Generation of Candidate Itemsets and Count Algorithm for Mining Association Rules
by: Pei-Yun Wu, et al.
Published: (2004) -
Mining Association rules for Low-Frequency itemsets.
by: Jimmy Ming-Tai Wu, et al.
Published: (2018-01-01)