:::

詳目顯示

回上一頁
題名:在包裹資料庫中挖掘數量關聯規則
書刊名:資訊管理學報
作者:陳彥良許秉瑜 引用關係凌俊青
作者(外文):Chen, Yen-liangHsu, Ping-yuLing, Chun-ching
出版日期:2001
卷期:7:2
頁次:頁215-229
主題關鍵詞:資料挖掘關聯規則模糊集合Data miningAssociation ruleFuzzy set
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(5) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:5
  • 共同引用共同引用:0
  • 點閱點閱:33
所謂挖掘關聯規則,是要從企業銷售交易資料庫中,找出項目之間的關聯性。過去研究所找出的關聯規則通常只能表達項目間有否相關,卻無法表達它們在不同購買數量時間相關性。如此所產生的問題是,我們將無法知道該以什麼的比例來搭配不同產品一齊販售。因此若關聯規則能加入項目數量資訊的話,將非常有益於制訂行銷策略。本文所提出的演算法,可以找尋出包含項目數量的關聯規則。接著利用指定項目數量的區問及模糊集合原理,找出具有語意的關聯規則。
The problem of mining association rules is to find the associations between items in a large database of sales transactions. Although there are a lot of previous researches on this area, a common problem occurred is that the rule only indicates if two items are related but as to in what quantities and in what combinations are missing. Without this information it is impossible to design a competitive combination of sales items since we didn’t know how many units of items should be included. Therefore, if the quantities of items can be included in association rules, it will be helpful for managers to make the marketing decisions. In this paper, we introduce a new algorithm for mining association rules including the quantities of items. Then, we extend the rules so that the quantities of items can be expressed as user-defined intervals or fuzzy terms.
期刊論文
1.Park, J. S.、Chen, M. S.、Yu, P. S.(1995)。An effective hash-based algorithm for mining association rules。Association for computing machinery special interest group on management of data,24(2),175-186。  new window
2.Agrawal, R.、Shafer, J. C.(1996)。Parallel Mining of Association Rules: Design, Implementation, and Experience。IEEE Transactions on Knowledge and Data Engineering,8(6),962-969。  new window
3.Chen, Ming-Syan、Han, Jiawei、Yu, Philip S.(1996)。Data Mining: An Overview from a Database Perspective。IEEE Transactions on Knowledge and Data Engineering,8(6),866-883。  new window
4.Kuok, C. M.、Fu, A.、Wong, M. H.(1998)。Mining Fuzzy Association Rules in Databases。SIGMOD,41-46。  new window
5.Savasere, A.、Omiecinski, E.、Navathe, S.(1995)。An Efficient Algorithm for Mining Association Rules in Large Databases。VLDB,432-443。  new window
會議論文
1.Agrawal, R.、Imielinski, T.、Swami, A. N.(1993)。Mining Association Rules between Sets of Items in Large Databases。The 1993 ACM SIGMOD International Conference on Management of Data,207-216。  new window
2.Cheung, D. W.、Ng, V.、Han, J.、Wong, C. Y.(1996)。Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique。The 12th International Conference on Data Engineering,106-114。  new window
3.Han, J.、Fu, Y.(1995)。Discovery of Multiple-level Association Rules from Large Databases。Zürich, Switzerland。420-431。  new window
4.Srikant, R.、Agrawal, R.(1996)。Mining Quantitative Association Rules in Large Relational Tables。The ACM-SIGMOD International Conferences。Montreal:ACM Digital Library。1-12。  new window
5.Srikant, Ramakrishnan、Agrawal, Rakesh(1995)。Mining Generalized Association Rules。The 21st International Conference on Very Large Data Bases。Zurich。407-419。  new window
6.Agrawal, R.、Srikant, R.(1994)。Fast algorithms for mining association rules in large database。The 20th International Conference on Very Large Data Bases。Morgan Kaufmann Publishers Inc.。478-499。  new window
7.Vu, Q.、Agrawal, R.、Srikant, R.(1997)。Mining Association Rules with Item Constraints。Newport Beach, CA。67-73。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
無相關書籍
 
無相關著作
 
QR Code
QRCODE