Mining Quantitative Association Rules with Density Constraint
碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 91 === A new approach, called PQAR (Partition-based Quantitative Association Rules mining) algorithm, is proposed in this thesis for mining quantitative association rules. This approach finds out all the frequent interval itemsets that satisfy the minimum relative den...
Main Author: | 郭瑞男 |
---|---|
Other Authors: | 柯佳伶 |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/13322880493417591245 |
Similar Items
-
Mining Association Rules with Multi-dimensional Constraints
by: Lin Wan-chuen, et al.
Published: (2003) -
Mining Quantitative Association Rules in Disease Databases
by: Jian-Ming Li, et al.
Published: (2000) -
Mining Quantitative Association Rules in Bag Databases
by: Chun-Ching Ling, et al.
Published: (1999) -
Mining High Utility Quantitative Association Rules
by: Chian-Yi Yang, et al.
Published: (2006) -
Efficiently mining association rules based on maximum single constraints
by: Anh Tran, et al.
Published: (2017-05-01)