政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/35280

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/35280

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113160/144130 (79%)
造访人次 : 50753000 在线人数 : 411

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 > Item 140.119/35280

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/35280

题名:	Mining Multi-Dimension Rules in Multiple Database Segmentation-on Examples of Cross Selling
作者:	吳家齊 Wu,Chia-Chi
贡献者:	姜國輝 CHIANG,Johannes K. 吳家齊 Wu,Chia-Chi
关键词:	資料探勘關聯規則多維度規則購物籃分析 data mining association rule Multi-dimension rule Basket analysis
日期:	2004
上传时间:	2009-09-18 14:37:32 (UTC+8)
摘要:	在今日以客戶為導向的市場中，“給較好的客戶較好的服務”的概念已經逐漸轉變為“給每一位客戶適當的服務”。藉由跨域行銷(cross-selling)的方式，企業可以為不同的客戶提供適當的服務及商品組合。臺灣的金融業近年來在金融整合中陸續成立了多家金融控股公司，希望藉由銀行、保險與證券等領域統籌資源與資本集中，以整合旗下子公司達成跨領域的共同行銷。這種新的行銷方式需要具有表達資料項目間關係的資訊技術，而關聯規則(association rule)是一種支援共同行銷所需之資料倉儲中的極重要元件。傳統關聯規則的挖掘可以用來找出交易資料庫中客戶潛在的消費傾向。如果得以進一步的鎖定是那些客戶在什麼時間、什麼地點具有這種消費傾向，我們可藉此制定更精確、更具獲利能力的行銷策略。然而，大部分的相關習成技術都假設挖掘出的規則在資料庫的每一個區間都是一樣有效的，然而這顯然不符合大多數的現實狀況。本研究主要著眼於如何有效率的在不同維度、不同大小的資料庫區域中挖掘關聯規則。藉此發展出可以自動在資料庫中產生分割的機制。就此，本研究提出一個方法找出在各個分割中成立的關聯規則，此一方法具有以下幾個優點： 1. 對於找出的關聯規則，可以進一步界定此規則在資料庫的那些區域成立。 2. 對於使用者知識以及資料庫重覆掃瞄次數的要求低於先前的方法。 3. 藉由保留中間結果，此一方法可以做到增量模式的規則挖掘。本研究舉了兩個例子來驗證所提出的方法，結果顯示本方法具有效率及可規模化方面均較以往之方法為優。 In today’s customer-oriented market, vision of “For better customer, the better service” becomes “For every customer, the appropriate service”. Companies can develop composite products to satisfy customer needs by cross-selling. In Taiwan’s financial sector, many financial holding companies have been consecutively founded recently. By pooling the resources and capital for banking, insurance, and securities, these financial holding companies would like to integration information resources from subsidiary companies for cross-selling. This new promotion method needs the information technology which can present the relationship between items, and association rule is an important element in data warehouse which supports cross-selling. Traditional association rule can discover some customer purchase trend in a transaction database. The further exploration into targets as when, where and what kind of customers have this purchase trend that we chase, the more precise information that we can retrieve to make accurate and profitable strategies. Moreover, most related works assume that the rules are effective in database thoroughly, which obviously does not work in the majority of cases. The aim of this paper is to discover correspondent rules from different zones in database. We develop a mechanism to produce segmentations with different granularities related to each dimension, and propose an algorithm to discover association rules in all the segmentations. The advantages of our method are: 1. The rules which only hold in several segmentations of database will be picked up by our algorithm. 2. Mining all association rules in all predefined segmentations with less user prior knowledge and redundant database scans than previous methods. 3. By keeping the intermediate results of the algorithm, we can implement an incremental mining. We give two examples to evaluate our method, and the results show that our method is efficient and effective.
參考文獻:	[1] Alexandre Evfimievski, Ramakrishnan Srikant, Rakesh Agrawal, Privacy preserving mining of association rules, Information System, 29 (2004) 343-364. [2] Bernd Vindevogel, Dirk Van den Poel, Geert Wets, Why promotion strategies based on market basket analysis do not work, Expert System with Application , 28 (2005) 583-590. [3] Bing Liu, Wynne Hsu, Yiming Ma, Mining Association Rules with Multiple Minmum Supports, ACM SIGKDD International Conference in Knowledge Discovery & Data Mining, San Diego, CA, USA, August 15-18 (1999). [4] Brian Lent, Arun Swami, Jennifer Widom, Clustering Association Rules, 13th International Conference on Data Engineering, (1997). [5] Chris Rygielski, Jyun-Cheng Wang, David C. Yen, Data mining techniques for customer relationship management, Technology in Society, 24 (2002) 483-502. [6] David Hand, Heikki Mannila, Padhraic Smyth, Principles of Data Mining, (2001), London, 427-448. [7] Guoqing Chen, Qiang Wei, Fuzzy association rules and the extended mining algorithms, Information Sciences, 147 (2002) 201-228 [8] Honghun Lu, Ling Feng, Jiawei Han, Beyond Intratransaction Association Analysis: Mining Multidimensional Intertransaction Association Rules, ACM Transactions on Information System, 18(4) (2000) 423-454. [9] Jiawei Han, Guozhu Dong, Yiwen Yin, Efficient Mining of Partial Periodic Patterns in Time Series Database, Proceedings of the 15th International Conference on Data Engineering, (1995)106-115. [10] Jiawei Han, Wan Gong, Yiwen Yin, Mining Segment-Wise Periodic Patterns in Time-Related Databases, International Conference on Knowledge Discovery and Data Mining, New York City, NY, August (1998). [11] Jiawei Han, Yiwen Yin, Mining frequent patterns without candidate generation, Proceedings of the ACM-SIGMOD International Conference on Management of Data, Dallas, TX, May (2000). [12] Jiawei Han, Yongjian Fu, Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Database, AAAI’94 Workshop on knowledge Discovery in Databases, 157-168, Seattle, WA, July (1994). [13] Jiawei Han, Yongjian Fu, Discovery of Multiple-Level Association Rules from Large Databases, Proceedings of the 21th International conference on Very Large Database, Zurich, Switzerland, (1995). [14] Jiawei Han, Micheline Kamber, Data Mining – concepts and techniques, San Francisco, Morgan Kaufmann, (2001). [15] Jiawei Han, Yongjian Fu, Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases, KDD Workshop, Seattle, Washington, USA, (1994). [16] Johan de Kleer, An Assumption-based TMS, Artificial Intelligence, 28(2)(1986)127-162. [17] Johan de Kleer, Extending the ATMS, Artificial Intelligence, 28(2) (1986) 163-196. [18] Johan de Kleer, Problem Solving with the ATMS, Artificial Intelligence, 28(2) (1986) 197-224. [19] Johan de Kleer, Brian C. Williams, Diagnosing Multiple Faults, Artificial Intelligence, 32(1) (1987) 97-130. [20] Kenneth D. Forbus, QPE: Using assumption-based truth maintenance for qualitative simulation, Artificial Intelligence in Engineering, 3(4) (1988) 85-168. [21] Pauray S.M. Tasi, Chien-Ming Chen, Mining interesting association rules from customer databases and transaction databases, Information Systems, 29 (2004) 685-696. [22] Rakesh Agrawal, John C. Shafer, Parallel Mining of Association Rules, IEEE Transactions on Knowledge and Data Engineering, 8(6) (1996) 962-969. [23] Rakesh Agrawal, Ramakrishnan Srikant, Fast algorithms for mining association rules in large databases, Proceedings of the International Conference on Very Large Data Bases, (1994) 487–499. [24] Ramakrishnan Srikant, Rakesh Agrawal, Mining Generalized Association Rules, Proceedings of the 21th VLDB Conference, Zurich, Swizerland, (1995). [25] Ramakrishnan Srikant, Rakesh Agrawal, Mining Quantitative Association Rules in Large Relational Tables, Proceedings of the ACM-SIGMOD 1996 Conference on Management of Data, Montreal, Canada, June (1996) 1-12. [26] Roberto J, Bayaede Jr., Rakesh Agrawal, Mining the most interesting rules, Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August (1999) 145-154. [27] Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur, Dynamic Itemset Counting and Implication Rules for Market Basket Data, Proceedings ACM SIGMOD international Conference on Management of Data, (1997) 255-264. [28] Sheng Ma, Joseph L. Hellerstein, Mining Mutually Depaendent Patterns, IEEE International Conference in Data Mining, (2001). [29] Dirk Van den Poel, Jan De Schamphelaere, Geert Wets, Direct and indirect effects of retail promotions, Expert Systems with Applications, 27(1) (2004) 53-62. [30] Wei Wang, Jiong Yang, Richard Muntz, Tempoeal Association Rules with Numberical Attributes, Proceedings of the 17th International Conference on Data Engineering, (2001) 283-292. [31] William J. Frawley, Gregory Piatetsky-Shapiro, Christopher J. Matheus, Knowledge discovery in database: An overview, Knowledge discovery in Database, (1991) 1-27 [32] Yen-Liang Chen, Kwei Tang, Ren-Jie Shen, Ya-Han Hu, Market basket analysis in a multiple store environment, Decision Support System, 40(2) (2005) 339-354. [33] Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia, Discovering calendar-based temporal association rules, Data & Knowledge Engineering 44 (2003) 193-218. [34] 姜國揮, 黃惠卿, 資訊科技在共同行銷應用之研究 ~ 以銀行與保障業務為例, 1994.9.
描述:	碩士國立政治大學資訊管理研究所 92356034 93
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0923560341
数据类型:	thesis
显示于类别:	[資訊管理學系] 學位論文

文件中的档案:

档案	描述	大小	格式	浏览次数
56034101.pdf		63Kb	Adobe PDF2	1011	检视/开启
56034102.pdf		21Kb	Adobe PDF2	981	检视/开启
56034103.pdf		19Kb	Adobe PDF2	981	检视/开启
56034104.pdf		19Kb	Adobe PDF2	898	检视/开启
56034105.pdf		157Kb	Adobe PDF2	1440	检视/开启
56034106.pdf		171Kb	Adobe PDF2	1035	检视/开启
56034107.pdf		67Kb	Adobe PDF2	1063	检视/开启
56034108.pdf		78Kb	Adobe PDF2	991	检视/开启
56034109.pdf		186Kb	Adobe PDF2	1003	检视/开启
56034110.pdf		46Kb	Adobe PDF2	1308	检视/开启
56034111.pdf		49Kb	Adobe PDF2	977	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈