博碩士論文 90421021 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:33 、訪客IP:18.216.251.37
姓名 江聿倩(Yu-Chien Chiang)  查詢紙本館藏   畢業系所 企業管理學系
論文名稱 以關聯規則的脈絡關係為架構的適應性產品推薦之研究
(Designing Adaptive Recommendation Systems with Context Hierarchy)
相關論文
★ 在社群網站上作互動推薦及研究使用者行為對其效果之影響★ 以AHP法探討伺服器品牌大廠的供應商遴選指標的權重決定分析
★ 以AHP法探討智慧型手機產業營運中心區位選擇考量關鍵因素之研究★ 太陽能光電產業經營績效評估-應用資料包絡分析法
★ 建構國家太陽能電池產業競爭力比較模式之研究★ 以序列採礦方法探討景氣指標與進出口值的關聯
★ ERP專案成員組合對績效影響之研究★ 推薦期刊文章至適合學科類別之研究
★ 品牌故事分析與比較-以古早味美食產業為例★ 以方法目的鏈比較Starbucks與Cama吸引消費者購買因素
★ 探討創意店家創業價值之研究- 以赤峰街、民生社區為例★ 以領先指標預測企業長短期借款變化之研究
★ 應用層級分析法遴選電競筆記型電腦鍵盤供應商之關鍵因子探討★ 以互惠及利他行為探討信任關係對知識分享之影響
★ 結合人格特質與海報主色以類神經網路推薦電影之研究★ 資料視覺化圖表與議題之關聯
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 由於電子商務盛行,企業必須在更短的期間內提供更多的產品與服務給消費者才能為持競爭優勢。然而消費者暴露在過多的資訊下往往無法做出正確的決策,為了改善資訊爆炸的問題,推薦系統因而被企業大量採用。
一個良好的推薦系統必須具備互動性、適應性、並且具備足夠的正確性。然而目前大部分的推薦系統並不能滿足上述所有的條件。由於缺乏與消費者間的互動,現行的推薦系統無法及時修正推薦方向來滿足消費者的需求變動。一但消費者在作決策時無法獲得足夠的資訊,他們將不會感到滿意。
在本研究中,我們想要介紹一個理想推薦系統,並以KTV推薦點歌服務為例。我們提出一個新的方法,根據資料挖掘出的關聯規則建立起概念階層,並根據消費者的決策在概念階層中上升與下降移動,並即時地修正推薦的方向,如此我們能夠達成大量推薦的目的並維持一定的推薦正確性。
摘要(英) For KTV, virtual storefronts and many other industries, the recommendation systems have to be interactive, adaptive and accurate enough since customers make series of decisions quickly. A system slowly adapt to customers need may find customers make all decisions before the system can react. Therefore, an ideal recommendation system for customers who make a set or series of decisions quickly should have following characteristics: interactive, adaptive, accurate enough, bulk recommendations. However, most recommender systems can’t meet all conditions. Because of the lack of interacting with customers, current recommender systems can not adapt to customers in real time. Once, customers can not obtain useful information when making decision and they would never be satisfied.
In this paper, we want to introduce an ideal recommender system applied to KTV server. We propose a new method to produce recommendations based on a context hierarchy for association rules which are discovered from picking historical data. By rolling up and drilling down the context level, we are able to make bulk recommendations. After recommending, we measure the accuracy of suggestion for quickly adaptive to customers.
關鍵字(中) ★ 大量推薦
★ 推薦系統
★ 概念階層
★ 關聯規則
關鍵字(英) ★ Context Hierarchy
★ Association rule
★ Recommendation Systems
論文目次 CHAPTER 1 INTRODUCTION 1
1.1 RESEARCH BACKGROUND 1
1.2 RESEARCH MOTIVATION 1
1.3 RESEARCH GOAL AND IMPORTANCE 2
1.4 THESIS ORGANIZATION 3
CHAPTER 2 BACKGROUND AND RELATED WORK 4
2.1 RECOMMENDER SYSTEM 4
2.1.1 Content-based and Collaborative filtering system 6
2.1.2 Collaborative filtering system 7
2.1.3 Hybrid filtering system 9
2.2 CURRENT RECOMMENDATION TECHNIQUES 11
2.2.1 Clustering 11
2.2.2 Association Rules 15
CHAPTER 3 RECOMMENDER SYSTEM DESIGN 23
3.1 DATA PREPARATION AND PATTERN DISCOVERY 25
3.1.1 Data preparation 25
3.1.2 Pattern discovery 28
3.2 THE RECOMMENDATION STRATEGY 34
3.2.1 Producing recommendations 34
3.2.2 Measuring the recommendation quality 35
3.2.3 Measuring the preference between different nodes 39
CHAPTER 4 ALGORITHM 41
CHAPTER 5 CONCLUSIONS AND FUTURE WORK 45
5.1 CONCLUDING REMARKS 45
5.2 FUTURE WORK 46
REFERENCE 47
參考文獻 [1] J. Ben Schafer, Joseph A. Konstan, and John Riedl, “E-Commerce recommendation applications”, Data mining and knowledge discovery, 5, pp 115-153, 2001.
[2] Ayhan Demiriz, “Enhancing product recommender systems on sparse binary data”, Under journal review, Feb.2002.
[3] Marko Balabanovic and Yoav Shoham, “ Fab: Content-based, collaborative recommender”, Communications of the ACM, 40(3):pp 66–72, March 1997.
[4] Cyrus Shahbi and Yi-shin Chen “An adaptive recommendation system without explicit acquisition of user relevance feedback”, Kluwer academic Publishers, 2002.
[5] Krulwich, B., and Burkey, C., “Learning user information interests through extraction of semantically significant phrases”, AAAI Spring Symposium on Machine Learning in Information Access, March 1996.
[6] Lang, K. “Newsweeder: Learning to filter netnews”, The 12th International Conference on Machine Learning, 1995.
[7] Harman, D., “Over view of the 3rd Text Retrieval Conference”, The 3rd Text Retrieval Conference, Nov 1994.
[8] Zhaoxia Wang, “Collaborative filtering using error-tolerant fascicles”, Simon Fraser University, March 2001.
[9] Paul Resnick, Neophytos Iacovou, Mitesh Sushak, Peter Bergstrom, John Riedl, “GroupLens: An open architecture for collaborative filtering of netnews”, CSCW 1994 conference, Oct. 1994.
[10] Hill, W., Stead, L., Rosenstein, M., and Furnas, G., “Recommending and evaluating choices in a virtual community of us”, Conference on Human Factors in Computing Systems, May 1995.
[11] Shardanand, U., and Maes, P., “Social information filtering: Algorithms for automating “word of mouth”, Conference on Human Factors in Computing Systems, May 1995.
[12] Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl, “Item-based Collaborative Filtering Recommendation Algorithms”, the 10th International World Wide Web Conference, May 2001.
[13] Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl, “Analysis of Recommendation Algorithms for E-Commerce”, EC’00 ACM, 2000.
[14] Lyle H. Ungar and Dean P. Foster, “Clustering methods for collaborative filtering”, Fifteenth National Conference on Artificial Intelligence, July 1998.
[15] John S. Breese, David Heckerman and Carl Kadie, “Empirical analysis of predictive algorithms for collaborative filtering”, Fourteenth Annual Conference on Uncertainty in Artificial Intelligence, pp 43–52, July 1998.
[16] Jiawei Han, Micheline Kamber, “Data mining: Concepts and Techniques”, Morgan Kaufmann, 2000
[17] J. MacQueen, “Some methods for classification and analysis of multivariate observations”, 5th Berkeley Symp. Math. Statist, Prob.,1: pp281-297, 1967
[18] L.Kaufman and P.J Rousseeuw, “Finding group in data: an introduction to cluster analysis, New York: John Wiley & Sons, 1990.
[19] R.Ng and J. Han. “Efficient and effective clustering method for spatial data mining”, 1994 Int. Conf. VLDB, pp 144-155, Sept. 1994.
[20] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu., “A density-based algorithm for discovering clusters in large spatial databases”, 1996 Int. Conf. KDD, pp 226-231, Aug. 1996.
[21] A. Hinneburg and D. A. Keim, “An efficient approach to clustering in large multimedia databases with noise”, KDD'98, Aug. 1998.
[22] G. Sheikholeslami, S. Chatterjee, and A. Zhang, “WaveCluster: A multi-resolution clustering approach for very large spatial databases”, 24th Int. Conf. VLDB, pp 24-27, Aug. 1998.
[23] R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, “Automatic subspace clustering of high dimensional data for data mining applications”, SIGMOD’98, pp 94-105, June 1998.
[24] U. Fayyad, K.B. Irani., “Multi-interval discretization of continuos-value attributes as preprocessing for classification learning”, 13th Int. Join Conference on Artificial Intelligence, pp 1022-1027, 1993.
[25] Gennari, J. H., Langley, P., and Fisher, D. H. 1989. “Models of incremental concept formation” Artificial Intelligence, 40: pp 11-61, 1989.
[26] P. Cheeseman, J. Stutz, “Bayesian classification (AutoClass): Theory and results”, in Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, & Ramasamy Uthurusamy, Eds.Advances, Advances in Knowledge Discovery and Data Mining , 1996.
[27] Jain, A.K. and Dubes, R.C., “Algorithms for clustering data”, Prentice Hall, 1988.
[28] Anderberg, M. R., “Cluster analysis for applications”, Academic Press, Inc., 1973.
[29] Salton, G., “Developments in automatic text retrieval”, Science 253, pp 974–980, 1991.
[30] H´ajek, P., Havel, I., and Chytil, M., “The GUHA method of automatic hypotheses determination”, Computing, 1: pp293–308, 1966.
[31] H´ajek, P. and Havranek, T., “On generation of inductive hypotheses”, Int. J. Man-Machine Studies, 9: pp 415–438, 1977.
[32] Agrawal, R., Imielinski, T., and Swami, A., “Mining association rules between sets of items in large databases”, ACM SIGMOD Conference on Management of Data, pp. 207–216, 1993.
[33] Agarwal, R.C., Aggarwal, C.C., and Prasad, V., “Depth first generation of long patterns”, 6th ACM SIGKDD Conference on KDD, Boston, MA, pp. 108–118. 2000.
[34] Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl, “Analysis of recommendation algorithms for E-Commerce”, EC’00, pp 17-20, October, 2000.
指導教授 許秉瑜(Ping-Yu Hsu) 審核日期 2004-7-14
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明