An efficient model for mining precise quantitative association rules with multiple minimum supports

勤益科大機構典藏 > 管理學院 > 資訊管理系(研發與科技管理研究所) > 【資訊管理系】期刊論文 > Item 987654321/7154

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/7154

题名:	An efficient model for mining precise quantitative association rules with multiple minimum supports
作者:	陳仕昇
贡献者:	資訊管理(學)系
日期:	2012-01
上传时间:	2018-01-30 14:46:25 (UTC+8)
摘要:	Association rule mining deals with the correlations of items in a transaction. However, this approach raises two problems. First, each item is set with a uni ed minimum support which cannot be applied in actual applications. The reason is that the frequencies at which items are bought differently. In a shopping case, some items are bought frequently but others are seldom bought because of demand or price. Therefore, setting a unified higher threshold value makes it difficult to find rare items with higher prices, while a unified lower threshold value might lead to a combinational explosion problem. Second, traditional association rules lack quantityrelated information and cannot reveal the quantities of different items in an association rule. Therefore, this study proposes quantity-related association rules adopting multiple minimum supports to address these two problems. An efficient algorithm is developed based on a divide-and-conquer idea to find precise quantitative association rules with multiple minimum supports in bag databases. Experiments show the algorithm's computational efficiency and scalability. Our research model can contribute to applications in more realistic circumstances in cases where items occur at various frequencies and have different quantity-related information. © 2013 ICIC International. (21 refs)
關聯:	International Journal of Innovative Computing, Information and Control
显示于类别:	[資訊管理系(研發與科技管理研究所)] 【資訊管理系】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.

数据加载中.....