透過多門檻限制採擷跨概念階層間於產品銷售期間的關聯規則

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：37

、訪客IP：18.226.166.156

姓名

薛頠浚(Wei-Chun Hsueh) 查詢紙本館藏

畢業系所

工業管理研究所

論文名稱

透過多門檻限制採擷跨概念階層間於產品銷售期間的關聯規則
(Mining Cross-Level Association Rules with Multiple Minimum Supports within the Sold Periods of Products)

相關論文

★ 以類神經網路探討晶圓測試良率預測與重測指標值之建立	★ 六標準突破性策略—企業管理議題
★ 限制驅導式在製罐產業生產管理之應用研究	★ 應用倒傳遞類神經網路於TFT-LCD G4.5代Cell廠不良問題與解決方法之研究
★ 限制驅導式生產排程在PCBA製程的運用	★ 平衡計分卡規劃與設計之研究-以海軍後勤支援指揮部修護工廠為例
★ 木製框式車身銷售數量之組合預測研究	★ 導入符合綠色產品RoHS之供應商管理-以光通訊產業L公司為例
★ 不同產品及供應商屬性對採購要求之相關性探討－以平面式觸控面板產業為例	★ 中長期產銷規劃之個案探討 -以抽絲產業為例
★ 消耗性部品存貨管理改善研究-以某邏輯測試公司之Socket Pin為例	★ 封裝廠之機台當機修復順序即時判別機制探討
★ 客戶危害限用物質規範研究-以TFT-LCD產業個案公司為例	★ PCB壓合代工業導入ISO/TS16949品質管理系統之研究-以K公司為例
★ 報價流程與價格議價之研究–以機殼產業為例	★ 產品量產前工程變更的分類機制與其可控制性探討-以某一手機產品家族為例

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

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

摘要(中)

本研究考慮多門檻限制以及產品的銷售期間，採擷跨階層間在各產品銷售期間的關聯規則。
考慮多門檻限制的跨階層關聯規則採擷是相當重要的研究。然而他們尚未考慮到多門檻限制以及產品生命週期或是產品銷售期對於大型資料庫關聯規則採擷的影響。以往對於多門檻限制採擷單一階層的方法有MSApriori,其能夠讓使用者依照產品實際販賣次數來設定各產品的門檻值。然而在零售店內有許多產品並非是整年都有販賣，因此我們應該要考慮各產品在其銷售期間的交易紀錄來計算support值。過去以往的研究大部分採用Apriori延伸出來的方法，稱之為CL_Apriori，以進行跨階層的關聯規則採擷。然而CL_Apriori 演算法主要是依由上而下且逐層的方式進行採擷，例如 MMS_Cumulate。不過在過去的方法不僅在採擷的效率上不彰，更無法採擷出完整的跨階層關聯規則。
本研究提出一個以FP-tree演算法為基礎加入了多門檻限制的設定，由下往上同時合併考量的方式來採擷跨階層的關聯規則的演算法，稱之CL_FP-tree(MIS)。此方法能夠改進以往考慮多門檻限制採擷大型資料庫的跨階層關聯規則的效率問題，也能夠得到更多更有趣的潛在關聯規則。我們延伸林宏韋(2003)計算跨階層產品銷售次數的方法，加入了計算各產品銷售期來計算各產品support值的方法。
我們利用實際的資料驗證CL_FP-tree(MIS)的確比CL_Apriori(MIS)更有效率，同時CL_FP-tree(MIS)也能夠採擷更多的跨階層關聯規則。同時，CL_FP-tree(MIS)也解決了以往採擷大型資料庫時，因為資料庫越大但是1-frequent items的數目越少的狀況。

摘要(英)

Cross-level association rules mining with multiple minimum supports is an important generalization of the association rule mining problem. Instead of setting a single minimum support for all items, Liu et al. proposed a method, named MSApriori, to allow users for specifying multiple minimum supports to reflect the natures of the items. Because not all items are sold in a whole year, we should consider the transactions in the sold periods of items as we calculate the supports of items. Previous techniques for mining cross-level association rules with multiple minimum supports are most top-down, progressive depending method extended from Apriori algorithm, e.g. MMS_Cumulate. Previous approaches result in worse mining efficiency and incompleteness of mined rules.
In this research, we propose a bottom-up, simultaneously merging method based on CL_FP-tree, called CL_FP-tree (MIS), to improve the mining efficiency and completeness of mining cross-level association rule with multiple minimum supports. We extend the procedure, which proposed by Alex H.W. Lin (2003) for supports counting, not only to count the supports for all items, but also to judge the sold periods of all items as the basis of support counting. CL_FP-tree (MIS) aims to reduce the number of database rescans for finding the cross-level information.
We implement the CL_FP_tree (MIS) with real data and find the results that the efficiency of CL_FP_tree (MIS) is better than CL_Apriori(MIS). And the number of cross-level association rules found by CL_FP-tree (MIS) algorithm is more than CL_Apripri(MIS). Furthermore, we solve the problem that the number of 1-frequent items decreasing as long as the number of transactions increasing.

關鍵字(中)

★ 產品銷售期
★ 跨階層關聯規則
★ 動態概念階層
★ 多門檻限制
★ FP樹演算法

關鍵字(英)

★ Cross-level Association Rule
★ Multiple Minimum Supports
★ FP-tree Algorithm
★ Sold Periods
★ Dynamic Concept Hierarchy

論文目次

CHAPTER 1 INTRODUCTION 1
1.1 MOTIVATION AND BACKGROUND 1
1.2 PROBLEM DESCRIPTION 3
1.3 RESEARCH OBJECTIVE 4
1.4 RESEARCH METHODOLOGY 4
CHAPTER 2 LITERATURE REVIEW 7
2.1 ASSOCIATION RULES MINING AMONG MULTIPLE CONCEPT LEVELS 7
2.2 ASSOCIATION RULES MINING WITH MULTIPLE MINIMUM SUPPORTS 7
2.3 CROSS-LEVEL ASSOCIATION RULES MINING WITH MULTIPLE MINIMUM SUPPORTS 8
2.4 MINING TEMPORAL PATTERNS WITH TIME WINDOWS 9
CHAPTER 3 ALGORITHM 10
3.1 MSAPRIORI 10
3.2 CL_FP-TREE(MIS) ALGORITHM 13
3.2.1 CL-FP-Tree(MIS) Construction 13
3.2.2 CL-FP-Tree growth(MIS) 34
CHAPTER 4 EXPERIMENT EVALUATION AND PERFORMANCE STUDY 39
4.1 EXPERIMENTAL ENVIRONMENT 39
4.2 SALES DATA BACKGROUND 39
4.3 EXPERIMENTAL RESULTS AND ANALYSIS 39
CHAPTER 5 CONCLUSION AND FURTHER RESEARCH 54
5.1 CONCLUSION 54
5.2 FURTHER RESEARCH 55
APPENDIX A 57
APPENDIX B 58
APPENDIX C 59
APPENDIX D 63
REFERENCE 66

參考文獻

Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining Association Rules Between Sets of Items in Large Databases. Proc. 1993 ACM SIGMOD Int’l Conf. on Management of Data, Washington, D.C. (pp. 207 – 216).
Agrawal, R., H. Mannila, R. Shikant, H. Toivonen, A. I. Verkamo. (1996). Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining. (pp.307 – 328)
Agrawal, R., & Srikant, R. (1996). Mining Sequential Patterns: Generalizations and Performance Improvements. Research Report. IBM Research Division.
Agrawal, R. & Srikant, R. (1995). Mining sequential patterns. International Conference on Database Engineering, IEEE, 1995. (pp. 3–14).
Ale, J. & Rossi, G. (2000). An approach to discovering temporal association rules. Proc. of the 2000 ACM Symposium on Applied Computing, (pp. 294–300).
A. U. Tansel & N. F. Ayan. (1998). Discovery of Association Rules in Temporal Databases. American Association for Artificial Intelligence, NY. USA.
Han, J., & Fu, Y. (1995). Discovery of Multiple-Level Association Rules from Large Databases. Proc. of the 21st VLDB Conf., Zurich, Switzerland.
Han, J., & Kamber, M. (2001). Data Mining：Concept and Techniques. Morgan Kaufmann Publishers. San Francisco, CA.
Han, J., Pei, J., & Yin, Y. (2000). Mining Frequent Patterns without Candidate Generation. Proc. of the ACM Int. Conf. on Management of Data, Dallas, TX.
Hu, Y. H. & Chen, Y. L. (2003). Discovering and Maintaining Association Rules with Multiple Minimum Supports. Department of Information Management, National Central University Chung-Li 320, Taiwan , R.O.C
Liu, B., Hsu, W. & Ma,Y. (1999). Mining Association Rules with Multiple Minimum supports. Proc. 1999 ACM SIGMOD Int’l Conf. on Management of Data, San Diego, CA, USA.
Lu, H., Feng, L., & Han, J. (2000). Beyond Intratransaction Association Analysis：Mining Multidimensional Intertransaction Association Rules. ACM Press, NY, USA. 18(4).
Mannila, H., Toivonen, H., & Verkamo, A. I. (1995). Discovering frequent episodes in sequences (extended abstract). Proc. 1st Conference on Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, (pp. 210-215).
Park, J. S., Chen, M., & Yu, P. S. (1999). An Effective Hash-Based Algorithm for Mining Association Rules. Database Systems for Advanced Applications. (pp. 179-186).
Tseng, M. C. & Lin, W. Y. (2001). Mining Generalized Association Rules with
Multiple Minimum Supports. I-Shou University, Kaohsiung 84008, Taiwan.
Wang. K., He, Y. & Han, J. (2003). Pushing Support Constrains Into Association Rules Mining. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 15, NO. 3, MAY/JUNE 2003. (pp.642-658)
Y. Li, P. Ning, X. S. Wang & S. Jajodia. (2001). Discovering Calendar-based Temporal Association Rules. Center for Secure Information Systems, George Mason University, Fairfax, VA 22030, USA.

指導教授

沈國基(Gwo-Ji Sheen)

審核日期

2004-6-28

推文