以資料探勘發掘替代品之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：36

、訪客IP：13.58.24.13

姓名

黃世翔(Shih-Hsiang Huang) 查詢紙本館藏

畢業系所

企業管理學系

論文名稱

以資料探勘發掘替代品之研究
(A Economical Framework for Mining Substitution Rules)

相關論文

★ 在社群網站上作互動推薦及研究使用者行為對其效果之影響	★ 以AHP法探討伺服器品牌大廠的供應商遴選指標的權重決定分析
★ 以AHP法探討智慧型手機產業營運中心區位選擇考量關鍵因素之研究	★ 太陽能光電產業經營績效評估－應用資料包絡分析法
★ 建構國家太陽能電池產業競爭力比較模式之研究	★ 以序列採礦方法探討景氣指標與進出口值的關聯
★ ERP專案成員組合對績效影響之研究	★ 推薦期刊文章至適合學科類別之研究
★ 品牌故事分析與比較-以古早味美食產業為例	★ 以方法目的鏈比較Starbucks與Cama吸引消費者購買因素
★ 探討創意店家創業價值之研究- 以赤峰街、民生社區為例	★ 以領先指標預測企業長短期借款變化之研究
★ 應用層級分析法遴選電競筆記型電腦鍵盤供應商之關鍵因子探討	★ 以互惠及利他行為探討信任關係對知識分享之影響
★ 結合人格特質與海報主色以類神經網路推薦電影之研究	★ 資料視覺化圖表與議題之關聯

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

在資料探勘的領域中，關聯法則可以反應出顧客購買時對其他物品也需同時購買的需求，現實中除了這樣的消費行為，若遇到商品缺貨或價格調整時，可能會購買替代商品來取代原始商品，因此商品間還存在另外一種關係─替代關係，如同關聯法則一樣，替代關係亦可以提供決策者更多的決策資訊。
　　本研究以資料探勘為學理基礎，加入經濟學上替代品的觀點發展替代法則的探勘，透過找出銷售交易資料庫中彼此符合經濟學替代品定義的商品來決定其是否具有替代關係，為了處理現實生活中的某些現象，並發展了、、和四個參數用以調整這些偏差。
　　以實際的超市交易資料實驗結果顯示，同一類別下的商品其替代法則會與現實生活中直覺較相似，除了完全替代關係，亦能適當地發掘其他部分替代關係，在不同分店和不同時期的消費者替代法則結果是不相同的，顯示地理位置和季節的不同會有不同的購買決策，其中季節因素又比地理位置因素來的重要。

摘要(英)

In data mining, association rule is used to discover products that co-purchase frequently within customer purchasing transactions. But if product is out of stock or price adjustment, a customer may be to replace the original purchase of some items with that of others. Therefore it exist another relation, substitution rules, in products. The mining of substitution rules, the same as that of association rules, will get very valuable knowledge in decision support.
In this thesis, the mining algorithm for substitution rules is based on the concept of data mining and definition of substitute in the economics. The substitution rules mining algorithm is designed to find out the products that comply with the definition of substitute in the transaction database with four parameter, , , and , for fitting in with real-life.
The substitution rules mining algorithm is implemented and experimented against the real supermarket database. It is shown that the algorithm not only can find out the perfect substitute but also can discover some imperfect substitutes. It is also verify that different branch store and period have distinct substitution rules, and season is more important than position.

關鍵字(中)

★ 資料探勘
★ 替代法則

關鍵字(英)

★ Substitution rule
★ Data mining

論文目次

中文摘要 I
Abstract II
目錄 III
圖目錄 IV
表目錄 V
1. 緒論 1
1.1 研究動機 1
1.2 研究目的 2
1.3 論文架構 2
2. 文獻探討 4
3. 研究方法 7
3.1 問題描述和探討 7
3.2 替代法則的定義 8
3.3 替代法則定義的討論 10
3.4 資料結構 15
3.5 替代法則的探勘演算法 17
4. 實驗 24
4.1 資料來源 24
4.2 實驗設計 25
4.3 實驗結果 26
5. 結論與建議 31
5.1 結論 31
5.2 未來研究方向 32
參考文獻 33

參考文獻

1. Agrawal R, and Srikant R. "Fast algorithms for mining association rules in large databases." Proceedings of the 20th international conference on very large data bases. Santiago de Chile, Chile, 1994. 478–499.
2. Agrawal R, Imielinski T, and Swami A. "Mining association rules between sets of items in large databases." Proceedings of the 1993 ACM SIGMOD international conference on management of data. Washington DC, 1993. 207–216.
3. AM, Ayad, El-Makky NM, and Taha Y. "Incremental mining of constrained association rules." Proceedings of the 1st SIAM conference on data mining. Chicago, 2001.
4. Bayardo RJ, Agrawal R, and Gunopulos D. "Constraint-based rule mining in large, dense databases." Proceedings of the 15th international conference on data engineering. Sydney, Austrialia, 1999. 188–197.
5. Chen M-S, Han J, and Yu PS. "Data mining: an overview from database perspective." IEEE Transactions on Knowledge and Data Engineering, 1996: 866–883.
6. Chen X, and Petrounias I. "Discovering temporal association rules: algorithms, language and system." Proceedings of the 16th international conference on data engineering. San Diego, 2000.
7. Han J, and Fu Y. "Discovery of Multiple-level association rules from large databases." Proceedings of the 21st international conference on very large data bases. Zurich, Switzerland, 1995. 420 - 431.
8. Han J, and Kamber M. Data mining: concepts and techniques. 2. San Francisco, CA: Morgan Kaufmann Publishers, 2006.
9. Han J, Pei J, and Yin Y. "Mining frequent patterns without candidate generation." Proceedings of the 2000 ACM-SIGMOD international conference on management of data. Dallas, TX, 2000. 1 - 12.
10. Handerson, James M, and Richard E. Quandt. Microeconomic Theory: A Mathematical Approach. New York: Mcgraw-Hill Book Company, 1958.
11. Ian H. Witten, and Eibe Frank. Data Mining: Practical Machine Learning Tools and Techniques. 2. Morgan Kaufmann, 2005.
12. J-FBoulicaut, ABykowski, and BJeudy. “Towards the tractable discovery of association rules with negations.” Proceedings of the 4th international conference on flexible query answering systems. Warsaw, Poland, 2000. 425 - 434.
13. JM, Ale, and Rossi G. "An approach to discovering temporal association rules." Proceedings of the 2000 ACM symposium on applied computing. Villa Olmo, 2000. 293 - 300.
14. Kantardzic, Mehmed. Data Mining: Concepts, Models, Methods, and Algorithms . John Wiley, 2003.
15. Lakshmanan LVS, Ng R, and Han J. "Optimization of constrained frequent set queries with 2-variable constraints." Proceedings of the 1999 ACM SIGMOD international conference on management of data. Philadelphia, 1999. 157 - 168.
16. Lee C-H, Lin C-R, and Chen M-S. "Sliding-window filtering: an efficient algorithm for incremental mining." Proceedings of ACM 10th international conference on information and knowledge management. Atlanta, 2001. 263 - 270.
17. Liu B, Hsu W, and Ma Y. "Mining association rules with multiple minimum supports." Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining. San Diego, 1999. 337 - 341.
18. Ma S, and Hellerstein JL. "Mining mutually dependent patterns." Proceedings of the 1st IEEE international conference on data mining. San Jose, CA, 2001. 409–416.
19. Mankiw, Gregory. Principles of Microeconomics. 3. South-Western College Pub, 2004.
20. Mannila H, and Rusakov D. "Decomposition of event sequences into independent components." Proceedings of the 1st SIAM conference on data mining. Chicago, 2001.
21. Park J-S, Chen M-S, and Yu PS. "Using a hash-based method with transaction trimming for mining association rules." IEEE Transactions on Knowledge and Data Engineering, 1997: 813–825.
22. Pei J, and Han J. "Can we push more constraints into frequent pattern mining?" Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining. Boston, 2000. 350 - 354.
23. Piatetsky-Shapiro, G., and W. J. Frawley. Knowledge Discovery in Databases. AAAI/MIT Press, 1991.
24. Savasere A, Omiecinski E, and Navathe S. "Mining for strong negative associations in a large database of customer transactions." Proceedings of the 14th international conference on data engineering. Orlando, 1998. 494 -502.
25. Srikant R, and Agrawal R. "Mining generalized association rules." Proceedings of the 21st international conference on very large data bases. Zurich, Switzerland, 1995. 407 - 419.
26. Teng Wei-Guang, Hsieh Ming-Jyh, and Chen Ming-Syan. "A statistical framework for mining substitution rules." Knowledge and Information Systems, 2005: 158 - 178.
27. TuckerB.Irvin. Economics for Today. South-Western College Pub, 2005.
28. Wang K, He Y, and Han J. "Mining frequent itemsets using support constraints." Proceedings of the 26th international conference on very large data bases. Cairo, 2000. 43 - 52.
29. 張清溪, 許嘉棟, 劉鶯釧, 吳聰敏. 經濟學理論與實際. 2004.
30. 廖珠惠. “使用資料探勘技術尋找產品間的互補性與替代性關係.” 2002.

指導教授

許秉瑜(Ping-yu Hsu)

審核日期

2007-7-20

推文