An efficient association rules mining algorithm and its application in mining weighted quantitative association rules with multiple support threshold
碩士 === 南台科技大學 === 資訊管理系 === 92 === The generation of frequent itemsets is an essential and time-consuming step in mining association rules. Most of the studies adopt the Apriori-based approach, which has great effort in generating candidate itemsets and needs multiple database accesses. Recent studi...
Main Authors: | Show-Ju Chen, 陳秀如 |
---|---|
Other Authors: | Jen-peng Huang |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/94659598291095856971 |
Similar Items
-
An Effective Algorithm for Mining Association Rules with Multiple Thresholds
by: Alfred Lin, et al.
Published: (2001) -
Mining Quantitative Association Rules with Multiple Minimum Supports
by: Chia-hui Zhuang, et al.
Published: (2005) -
Weight Algorithm with Multiple Supports for Mining Association Rules in Large Database
by: Wei-hann Ho, et al.
Published: (2003) -
An Efficient Algorithm for Mining Association Rules
by: I-pei chien, et al.
Published: (2003) -
Applying Discretization and Multiple Minimum Supports for Mining Quantitative Association Rules
by: Guan-Jie Liao, et al.