Efficient Algorithms for Mining Association Rules in Dynamic Minimum Supports
碩士 === 南台科技大學 === 資訊管理系 === 96 === As the rapid evolution of information technology, people may not live without it. Most of enterprises also use this technology to save much information in the database. With the data increase, the database become bigger. To identify potential and useful information...
Main Authors: | Yen-cheng chiang, 江彥呈 |
---|---|
Other Authors: | Chui-Cheng Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43658797345399162010 |
Similar Items
-
Mining Quantitative Association Rules with Multiple Minimum Supports
by: Chia-hui Zhuang, et al.
Published: (2005) -
A Study of Mining Multidimensional Association Rules based on Dynamic Minimum Supports
by: Kuang Tai,Jan, et al.
Published: (2000) -
Mining Time Sequence Association Rules with Multiple Minimum Supports
by: Hung Jung-Lung, et al.
Published: (2007) -
Efficient Algorithms for Mining Association Rules in Dynamic Databases
by: Wen-Jui Kao, et al.
Published: (2007) -
Mining Quantitative Association Rules with Multiple Minimum Supports Based Mainly on Profits
by: Yin-Liang Cheng, et al.
Published: (2007)