政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/130589
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51655381      線上人數 : 639
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/130589


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/130589


    題名: 基於偏態排序最佳化探討圖形學習表示法之分佈於推薦系統
    Exploring Distribution of Graph Embedding Based on Skewness Ranking Optimization for Recommender Systems
    作者: 莊喻能
    Chuang, Yu-Neng
    貢獻者: 蔡銘峰
    Tsai, Ming-Feng
    莊喻能
    Chuang, Yu-Neng
    關鍵詞: 推薦系統
    協同過濾法
    圖形學習表示法
    矩陣分解
    偏態排序法
    Recommender systems
    Collaborative filitering
    Graph embedding
    Matrix factorization
    Skewness optimization ranking
    日期: 2020
    上傳時間: 2020-07-01 13:50:07 (UTC+8)
    摘要: 近年來大數據以及機器學習技術的蓬勃發展，推薦系統被廣泛應用於各種資訊系( Information Systems )上。如何有效地利用這些巨量的資料增進推薦系統效能，成為具有挑戰的工作。圖形學習表示法( Graph Embedding )便是一種特徵提取 ( Feature Extraction ) 的技術，此方法目的在於如何有效的將不同節點以及節點間的關係投射到低維度向量空間並賦予特徵向量。因此，如何有效率且精準的描述這些向量空間的概念，也被加入到圖形學習表示法的領域。本論文基於非對稱常態分佈( Skew Normal Distribution)之特性，提出以機率分佈重新檢視表示法向量空間，並針對使用者與喜好物品在非對稱常態分佈上會趨向正向偏態( Positive Skewness )的特性，將偏態之概念加入目標函式中進行優化。特別的是，本論文所提出之偏態項優化式為一通用優化項，能適用於過去各種 State of The Art 推薦演算法上，進而重塑各種推薦演算法所構建之向量空間。從理論面來論述，我們證明了如何在優化各種推薦演算法上之餘，同時優化基於非對稱常態分佈之 Shape 參數，此參數與分佈之偏態值為正相關。此外，針對所提出之演算法能同時最大化接收者操作特徵曲線( Receiver Operating Characteristic Curve ( ROC Curve ) )之論述，我們也提出一數學證述來解釋與分析。在數據實驗上，本文以將此偏態優化項主要實驗於矩陣分解類之推薦算法上，且為了展示方法的一致性，我們也將此偏態優化項實驗在基於圖形學習表示法的推薦演算法上，來做驗證本方法的可行性與正確性。而為了驗證此方法，本文實驗於五種不同的真實世 界巨量資料上，並且針對兩種常見的推薦任務: Top-N 推薦任務以及 Query-based 推薦任務上皆有所比較與操作。最後，在實驗結果的部分，結果呈現出我們所提之演算法與過去各種 State of The Art 之推薦演算法中實際比較後皆取得更優的表現。
    In recent years, machine learning technology has drastically improved in adapting big data among various fields, including commercial streaming online service and recommendation systems. Especially in recommendation systems case, the user-based recommendation systems or personalized recommendation is one of the most challenging tasks. In this paper, hence, we propose a novel optimization criterion that leverages features of the skew normal distribution to better model the problem of personalized recommendation. Specifically, the developed criterion borrows the concept and the flexibility of the skew normal distribution and also based on three hyper-parameters to not only provide the degree of freedom in optimization and also highly attached to the optimization criterion. Moreover, we both provide the relation of optimization of the proposed criterion and the shape parameter in the skew normal distribution from theoretical point of view and provide the analogies and provide the theoretical proof on asymptotic analysis of the area under the ROC curve to our proposed method. Experimental results conducted on five large-scale real-world datasets reveal that our proposed optimization criterion significantly achieve the best performance of the state of the art and yields consistently on all tested datasets.
    參考文獻: [1] C.-M. Chen, M.-F. Tsai, Y.-C. Lin, and Y.-H. Yang. Query-based music recommendations via preference embedding. In Proceedings of the 10th ACM Conference on Recommender Systems, RecSys ’16, page 79–82. Association for Computing Machinery.
    [2] C.-M. Chen, C.-J. Wang, M.-F. Tsai, and Y.-H. Yang. Collaborative similarity em- bedding for recommender systems. In Proceedings of the 28th International Conference on World Wide Web, WWW ’19, page 2637–2643. Association for Computing Machinery.
    [3] A. Grover and J. Leskovec. Node2vec: Scalable feature learning for networks. In Proceedings of the 22th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, pages 855–864. Association for Computing Machinery, 2016.
    [4] M. A. Hasnat, J. Bohne, S. G. J. Milgram, and L. Chen. von mises-fisher mixture model-based deep learning: Application to face verification. In arXiv preprint arXiv:1706.04264, 2017.
    [5] R. He, W.-C. Kang, and J. McAuley. Translation-based recommendation. In Proceedings of the 11th ACM Conference on Recommender Systems, RecSys ’17, page 161–169. Association for Computing Machinery.
    [6] C.-K. Hsieh, L. Yang, Y. Cui, T.-Y. Lin, S. Belongie, and D. Estrin. Collaborative metric learning. In Proceedings of the 26th International Conference on World Wide Web, WWW ’17, page 193–201. International World Wide Web Conferences Steering Committee.
    [7] Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In Proceedings of the 8th IEEE International Conference on Data Min- ing, ICDM ’08, page 263–272. IEEE Computer Society.
    [8] S. Kabbur, X. Ning, and G. Karypis. Fism: Factored item similarity models for top-N recommender systems. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’13, page 659–667. Association for Computing Machinery.
    [9] Y.Koren, R.Bell ,and C.Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30–37.
    [10] D. Liang, J. Altosaar, L. Charlin, and D. M. Blei. Factorization meets the item embedding: Regularizing matrix factorization with item co-occurrence. In Proceedings of the 10th ACM Conference on Recommender Systems, RecSys ’16, page 59–66. Association for Computing Machinery.
    [11] T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionally. In Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS ’13, pages 3111–3119. Curran Associates Inc., 2013.
    [12] X. Ning and G. Karypis. Slim: Sparse linear methods for top-n recommender systems. In Proceedings of the 11th IEEE International Conference on Data Mining, ICDM ’11, page 497–506. IEEE Computer Society.
    [13] F. Niu, B. Recht, C. Re, and S. J. Wright. Hogwild! a lock-free approach to parallelizing stochastic gradient descent. In Proceedings of the 24th International Conference on Neural Information Processing Systems, NIPS’11, page 693–701. Curran Associates Inc.
    [14] R. Pan, Y. Zhou, B. Cao, N. N. Liu, R. Lukose, M. Scholz, and Q. Yang. One-class collaborative filtering. In Proceedings of the 8th IEEE International Conference on Data Mining, ICDM ’08, page 502–511. IEEE Computer Society.
    [15] B. Perozzi, R. Al-Rfou, and S. Skiena. Deepwalk: Online learning of social representations. In Proceedings of the 29th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’14, pages 701–710. Association for Computing Machinery, 2014.
    [16] S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI ’09, page 452–461. AUAI Press.
    [17] J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei. Line: Large-scale information network embedding. In Proceedings of the 19th International Conference on World Wide Web, WWW ’15, pages 1067–1077. International World Wide Web Conferences Steering Committee, 2015.
    [18] Y. Tian, X. Yu, B. Fan, F. Wu, H. Heijnen, and V. Balntas. Sosnet: Second order similarity regularization for local descriptor learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR ’19. Institute of Electrical and Electronics Engineers, 2019.
    [19] H. Wang, M. Zhao, X. Xie, W. Li, and M. Guo. Knowledge graph convolutional networks for recommender systems. In Proceedings of the 28th International Conference on World Wide Web, WWW ’19, page 3307–3313. Association for Computing Machinery.
    [20] X. Wang, X. He, Y. Cao, M. Liu, and T.-S. Chua. Kgat: Knowledge graph attention network for recommendation. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’19, page 950–958. Association for Computing Machinery.
    [21] X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua. Neural graph collaborative filtering. In Proceedings of the 42nd International ACM SIGIR Conference on Re- search and Development in Information Retrieval, SIGIR’19, page 165–174. Association for Computing Machinery.
    [22] J. Weston, S. Bengio, and N. Usunier. Wsabie: Scaling up to large vocabulary image annotation. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI’11, page 2764–2770. AAAI Press.
    [23] J. Weston, H. Yee, and R. J. Weiss. Learning to rank recommendations with the k-order statistic loss. In Proceedings of the 7th ACM Conference on Recommender Systems, RecSys ’13, page 245–248. Association for Computing Machinery.
    [24] J.-H. Yang, C.-M. Chen, C.-J. Wang, and M.-F. Tsai. Hop-rec: High-order proximity for implicit recommendation. In Proceedings of the 12nd ACM Conference on Recommender Systems, RecSys ’18, page 140–144. Association for Computing Machinery.
    [25] X. Zhang, F.-X. Yu, K. Sanjiv, and S.-F. Chang. Learning spread-out local feature descriptors. In Proceedings of the IEEE International Conference on Computer Vision (ICCV), ICCV ’17. Institute of Electrical and Electronics Engineers.
    描述: 碩士
    國立政治大學
    資訊科學系
    107753011
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0107753011
    資料類型: thesis
    DOI: 10.6814/NCCU202000474
    顯示於類別:[資訊科學系] 學位論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    301101.pdf2880KbAdobe PDF2290檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 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 ©   - 回饋