簡易檢索 / 詳目顯示

研究生: 蕭欽元
Hsiao, Chin-Yuan
論文名稱: 整合約略集合與多重特徵探勘之推薦方法
A Novel Recommendation Approach based on Rough-Set and Multiple Features Mining
指導教授: 曾新穆
Tseng, Vincent Shin-Mu
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2008
畢業學年度: 96
語文別: 中文
論文頁數: 66
中文關鍵詞: 內涵式推薦協同過濾推薦關聯性法則資料探勘推薦系統約略集合
外文關鍵詞: Collaborative-filtering, Content-based recommendation, Association Rule, Data mining, Recommendation system, Rough-set theory
相關次數: 點閱:105下載:3
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著資訊科技的發達,不論是平面資訊或多媒體資料都有大幅度的成長,而如何在如此大量的資料中找出真正想要或感興趣的資料則是人們所面臨到的問題。推薦技術的方展則是為幫助人們在選擇上能夠更輕鬆、有效率的完成。以多媒體資料的推薦來說,在以往的研究中通常僅利用使用者對多媒體資料的評分或多媒體本身的特徵資料來做分析,而這些都各自有許多無法克服的問題存在,所以並不足以完全的幫助使用者取得他們真正想要的資料。在本研究中,我們提出了一個以整合約略集合方法為基礎並整合協同過濾資訊與內涵資訊的推薦方法,我們的方法主要考量了以下幾點:1).使用者分群,2).以關聯規則預測使用者評分,3).商品數量之簡化,如此一來就能夠完全克服過去推薦技術中所無法解決的問題,例如:新使用者之問題、新商品之問題、資料稀疏或資料量處理之執行效能的問題。經由實驗分析顯示,我們所提出的方法確實較現有其他方法在推薦技術上具有更高之準確度。

    The explosive growth of information makes people confused in making a choice among a huge amount of products, like movies, books, etc. To help people clarify what they want easily, in this study, we proposed an intelligent recommendation approach that integrates collaborative information and content features to predict user preferences on the basis of rough-set theory. The contribution of this paper is that our proposed approach can completely solve the traditional problems occurring in recent studies, such as cold-star, first-rater, sparsity and scalability problems. The empirical evaluation results reveal that our proposed approach can reduce the gap between user’s interest and recommended items more effectively than other existing approaches in terms of accuracy of recommendations.

    目錄 第一章 導論 1 1.1 研究背景 1 1.2 問題描述 3 1.3 研究方法 5 1.4 研究貢獻 6 1.5 論文架構 7 第二章 文獻探討 8 2.1 以模型為基礎之推薦方法(Model-based Recommendation) 8 2.1.1. 以分類為基礎之推薦方法(Classification-based Recommendation) 8 2.1.2. 以分群為基礎之推薦方法(Cluster-based Recommendation) 9 2.1.3. 以商品為基礎之協同過濾推薦方法(Item-based Recommendation) 10 2.2 以評分記錄為基礎之推薦系統方法(Memory-Based Recommendation) 12 2.2.1. 以使用者為基礎之協同過濾推薦方法(User-based Recommendation) 13 2.2.2. 以使用者關係過濾為基礎之推薦方法(Social Filtering Recommendation) 15 2.3 以內涵式分析為基礎之推薦方法(Content-based Recommendation) 16 2.4 以約略集合論(Rough Set Theory)為基礎之遺失值預測 17 2.5 關聯規則探勘 20 2.5.1. 關聯規則之定義 20 2.5.2. 關聯規則探勘演算法 21 第三章 研究方法 23 3.1. 方法架構 23 3.2. 資料定義 24 3.3. 訓練階段 25 3.3.1. 關聯規則探勘 26 3.3.2. 統計分析之評分預測模型(ModelACR)之建立 27 3.3.3. 使用者分群 28 3.4. 預測階段 30 3.4.1. 使用者分群 30 3.4.2. 應用關聯規則建立完整評分表 31 3.4.3. 約略集合論之評分預測模型(ModelRS) 32 3.4.4. 統計分析之評分預測模型(ModelACR)之預測 38 3.4.5. 混合式模型預測方法 39 第四章 實驗分析 40 4.1. 實驗設計 40 4.2. 實驗規劃 42 4.3. 實驗結果分析 44 4.3.1. 各種實驗參數設定分析 45 4.3.2. 方法比較 52 4.4. 實驗總結 58 第五章 結論 60 5.1. 研究結論 60 5.2. 未來研究發展與應用 61 5.2.1. 未來研究方向 61 5.2.2. 未來可應用性 62 相關文獻 63

    [1] http://movielens.umn.edu
    [2] http://www.amazon.com
    [3] R. Agrawal, T. Imielinski, and A. Swami. “Mining Association Rules between Sets of Items in Large Databases,” In Proceedings of ACM SIGMOD international conference on Management of data, pp. 207 – 216, Wanshion, D.C., May, 1993.
    [4] M. Balabanović, Y. Shoham. “Fab: Content-based Collaborative Recommendation.” Communications of the ACM, Vol. 40, pp. 66-72, 1997.
    [5] J. Basilico and T. Hofmann. “ Unifying collaborative and content-based filtering.” In Proceedings of the twenty-first international conference on Machine learning, pp. 9, Banff, Alberta, Canada, 2004.
    [6] C. Basu, H. Hirsh, and W. Cohen. “Recommendation as Classification: Using Social and Content-Based Information in Recommendation. “ In Proceedings of American Association for Artificial Intelligence, pp. 714-720, Madison, Wisconsin, United States, 1998.
    [7] R.M. Bell, Y. Koren, and C. Volinsky. “Modeling Relationships at Multiple Scales to Improve Accuracy of Large Recommender Systems.” In Proceedings of international conference on Knowledge discovery and data mining, pp. 95-104, San Jose, California, USA, 2007.
    [8] J.S. Breese, D. Heckerman, and C. Kadie. “Empirical Analysis of Predictive Algorithms for Collaborative Filtering.” In Proceedings of Conference on Uncertainty in Artificial Intelligence, pp. 43-52, 1998.
    [9] R. Burke. “Hybrid recommender systems: survey and experiments.” User Modeling and User-Adapted Interaction, Vol. 12, pp. 331-370, 2002.
    [10] P.A.D. Castro, F.O. Franca, H.M. Ferreira, F.J. Von Zuben. “Evaluating the Performance of a Biclustering Algorithm Applied to Collaborative Filtering – A Comparative Analysis.” Hybrid Intelligent Systems, 2007.
    [11] Y.U. Chuan, X.U. Jieping, and D.U. Xiaoyong. “Recommendation Algorithm combining the User-Based Classified Regression and the Item-Based Filtering. “ In Proceedings of the international conference on Electronic commerce, Fredericton, pp. 574-578, New Brunswick, Canada, 2006.
    [12] Y.B. Fernandez, J.J.P. Arias, M.L. Nores, A.G. Solla, M.R. Cabrer. “AVATAR: An Improved Solution for Personalized TV based on Semantic Inference.” IEEE Transactions on Consumer Electronic, Vol. 52, pp. 74, 2006.
    [13] N. Good, J.B. Schafer, J.A. Konstan, A. Borchers, B. Sarwar, J. Herlocker, and J. Riedl. “Combining Collaborative Filtering with Personal Agents for Better Recommendations.” In Proceedings of AAAI, pp. 439-446, Orlando, Florida, United States, 1998.
    [14] T.P. Hong, L.H. Tseng, and S.L. Wang. “Learning rules from incomplete training examples by rough sets.” Expert Systems with Applications, Vol. 22, pp. 285, 2002.
    [15] L.J. Hubert and J. Schultz. British Journal of Mathematical and Statistical Psychology. Vol. 29, pp. 190-241, 1976.
    [16] A.K. Jain and R.C. Dubes. ”Algorithms for Clustering Data.” Prentice Hall, 1988.
    [17] E.T. Jaynes. “Information Theory and Statistical Mechanics.”, Physical Review Vol. 106, pp. 620-630, 1957.
    [18] X. Jin, Y. Zhou, and B. Mobasher. “A Maximum Entropy Web Recommendation System:Combining Collaborative and Content Features.” In Proceeding of the ACM SIGKDD international conference on Knowledge discovery in data mining, 2005.
    [19] M. Kryszkiewiccz. “Rough set approach to imcomplete information system.” Information Sciences: an International Journal, Vol. 112, pp. 39 - 49, 1998.
    [20] J. Liang and Z. Xu. “Uncertainty measures of roughness of knowledge and rough sets in incomplete information systems.” Intelligent Control and Automation Proceedings of theWorld Congress, Vol. 4, pp. 2526-2529, 2000.
    [21] W. Lin, S.A. Alvarez, and C. Ruiz. “Collaborative Recommendation via Adaptive Association Rule Mining.” In Proceedings of Data Mining and Knowledge Discovery, 2002.
    [22] P. Melville, R.J. Mooney, and R. Nagarajan. “Content-Boosted Collaborative Filtering for Improved Recommendations.” In Proceedings of AAAI, pp.187-192, Edmonton, Alberta, Canada, 2002.
    [23] B. Mobasher, R. Burke, R. Bhaumik, and C. Williams. “Effective Attack Models for Shilling Item-Based Collaborative Filtering Systems.” In Proceedings of WebKDD Workshop, Chicago, 2005.
    [24] D. Nikovski and V. Kulev. “Induction of Compact Decision Trees for Personalized Recommendation.” In Proceedings of the ACM symposium on Applied computing, Dijon, France, April, 2006.
    [25] Z. Pawlak, S.K.M. Wong, and W. Ziarko, "Rough sets: Probabilistic versus deterministic approach." International Journal of Man-Machine Studies, Vol. 29, pp. 81-95, 1988.
    [26] A. Popescul, L. Ungar, D. Pennock, and S. Lawrence. “Probabilistic Models for Unified Collaborative and Content-based Recommendation in Sparse-data Environments.” In Proceedings of the Conference in Uncertainty in Artificial Intelligence, 2001.
    [27] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. “GroupLens: An Open Architecture for Collaborative Filtering of Netnews.” In Proceedings of ACM Conference on Computer Supported Coopertative Work, Chapel Hill, NC , 1994.
    [28] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. “Item-Based Collaborative Filtering Recommendation Algorithms.” In Proceedings of the 10th international conference on World Wide Web, pp. 285 – 295, Hong Kong , 2001.
    [29] B.M. Sarwar, J.A. Konstan, A. Borchers, J. Herlocker, B. Miller, and J. Riedl. “Using Filtering Agents to Improve Prediction Quality in the GroupLens Research Collaborative Filtering System.” In Proceedings of ACM CSCW, pp. 345-354, Seattle, Washington, United States, 1998.
    [30] R. Schaefer. "Rules for Using Multi-Attribute Utility Theory for Estimating a User’s Interest.” Agent Based Information Systems Workshop, Dortmund, Germany, October, 2001
    [31] A.I. Schein, A. Popescul, L.H. Ungar, and D.M. Pennock. “Methods and Metrics for Cold-Start Recommendations.” In Proceedings of ACM SIGIR, pp.253-260, Tampere, Finland, 2002.
    [32] V. Schickel-Zuber and B. Faltings. “Using Hierarchical Clustering for Learning the Ontologies used in Recommendation Systems.” In Proceedings of international conference on Knowledge discovery and data mining, pp. 599-608, San Jose, California, USA, 2007.
    [33] V. Schickel and B. Faltings. “Inferring user’s preferences using ontologies.” In AAAI, pp. 1413–1418, 2006
    [34] U. Shardanand and P. Maes. “Social Information Filtering: Algorithms for automating “word of mouth”.” In Proceedings of the SIGCHI conference on Human factors in computing systems, pp. 210 - 217, Denver, 1995.
    [35] L.H. Ungar, and D. P. Foster. “Clustering Methods for Collaborative Filtering.” In Workshop on Recommender Systems at the Nathional Conference on Artificial Intelligence, Madison, WI, 1998.
    [36] J. Wang, A.P. Vries, M.J.T. Reinders. “Unifying User-based and Item-based Collaborative Filtering Approaches by Similarity Fusion.” In Proceedings of the ACM SIGIR, pp. 501-508, Seattle, Washington, USA, 2006.
    [37] J.A. Xu and K. Araki. “A SVM-based Personal Recommendation System for TV programs.” In Proceedings of Multi-Media Modelling Conference, Beijing, China, 2006.
    [38] G.R. Xue, C. Lin, Q. Yang, W.S. Xi, H.J. Zeng, and Y. Yu. “Scalable Collaborative Filtering Using Cluster-based Smoothing.” In Proceedings of ACM SIGIR Conference, pp. 114-121, Salvador, Brazil, 2005.

    下載圖示 校內:2009-08-18公開
    校外:2010-08-18公開
    QR CODE