Mining high coherent association rules with consideration of support measure

doi:10.1016/j.eswa.2013.06.002

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/100103

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/100103

題名:	Mining high coherent association rules with consideration of support measure
作者:	Chen, Chun-Hao;Lan, Guo-Cheng;Hong, Tzung-Pei;Lin, Yui-Kai
貢獻者:	淡江大學資訊工程學系
關鍵詞:	Data mining;Association rules;Propositional logic;Coherent rules;Highly coherent rules
日期:	2013-11-15
上傳時間:	2015-01-28 11:07:34 (UTC+8)
出版者:	United Kingdom: Elsevier Science & Technology
摘要:	Data mining has been studied for a long time. Its goal is to help market managers find relationships among items from large databases and thus increase sales volume. Association-rule mining is one of the well known and commonly used techniques for this purpose. The Apriori algorithm is an important method for such a task. Based on the Apriori algorithm, lots of mining approaches have been proposed for diverse applications. Many of these data mining approaches focus on positive association rules such as “if milk is bought, then cookies are bought”. Such rules may, however, be misleading since there may be customers that buy milk and not buy cookies. This paper thus takes the properties of propositional logic into consideration and proposes an algorithm for mining highly coherent rules. The derived association rules are expected to be more meanful and reliable for business. Experiments on two datasets are also made to show the performance of the proposed approach.
關聯:	Expert Systems with Applications 40(16), pp.6531-6537
DOI:	10.1016/j.eswa.2013.06.002
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	201	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....