本文選題：上下文感知交互　切入點：推薦系統(tǒng)　出處：《山東師范大學》2017年碩士論文　論文類型：學位論文

【摘要】：伴隨著數(shù)字化網(wǎng)絡信息的普及,網(wǎng)絡上的信息承載越來越大。推薦系統(tǒng)的作用就是讓用戶在海量的數(shù)據(jù)中快速得到自己需要的信息。各種各樣的推薦系統(tǒng)也就應運而生,然而現(xiàn)在大多數(shù)針對推薦算法的研究都是關(guān)注提高推薦算法的精確度。然而我們熟悉的情境是,不同的用戶的需求是不同的,現(xiàn)在的人們置身于不同的社會事務當中,每個人在不同的時間節(jié)點、地點、情境等會有不同的偏好。本文認為不同的用戶所處的上下文信息不同,并且用戶所處的上下文情境對推薦系統(tǒng)不可見的,這就要求我們的推薦系統(tǒng)去探知用戶所處的上下文情境,并能夠按照探知的上下文情境進行實時的推薦,但是現(xiàn)在的上下文推薦系統(tǒng)對于這種感知功能的關(guān)注度還是比較低的,像是感知交互的過程等,很多問題還需要做出深一步的研究。本文對上下文感知交互推薦進行的主要研究工作如下:1.提出一種上下文感知的交互推薦算法。針對實時的推薦系統(tǒng),用戶的上下文情境是處于多變的情況下的,很難直接用傳統(tǒng)的用戶偏好提取技術(shù)訓練用戶的偏好模型。并且針對這種上下文情境多變的情況,用戶的上下文信息對系統(tǒng)是完全不可見的。本文認為針對用戶上下文情境的探知,可以運用系統(tǒng)的推薦列表與用戶對系統(tǒng)推薦的反饋列表進行交互的模式進行探知,本文提出一種交互模式,能夠動態(tài)的探知上下文的改變,并在此過程中實時更新用戶偏好模型,并用這種偏好模型監(jiān)視可能出現(xiàn)的探知偏差。本文提出對于推薦列表的更新是一種動態(tài)隨機分配最優(yōu)化問題,本文提出TP-Learning算法,這個算法是對貪婪算法的一種改進,是基于啟發(fā)式學習的,能夠為用戶得到一個效能最大化的推薦列表。本文提出的算法就是能夠?qū)崟r的去發(fā)現(xiàn)用戶上下文的改變,并按照當前的上下文模式對用戶偏好進行實時更新,并且運用這種機制提高推薦算法的表現(xiàn)。2.改進網(wǎng)絡結(jié)構(gòu)推薦算法(NBI)提出基于時間衰減和用戶相似權(quán)重的二部圖推薦算法(TUserCF)。基于二部圖的推薦算法是將每個用戶節(jié)點被賦予的資源值均分給相鄰的節(jié)點,本文認為應該將用戶選擇物品的時間因素考慮進去;我們對于算法的改進是基于當前社交網(wǎng)絡中社會化的因素,將用戶之間的關(guān)系進行擴充。我們對于資源值的分配問題時,首先考慮的就是評分矩陣的影響,其次就是用戶與用戶之間的興趣集合問題,好友集合參數(shù),并且對于時間的衰減進行說明,并基于時間的衰減引入了分配系數(shù)的加權(quán)改變過程。最后按照最后的資源值進行推薦,但是這種資源值的推薦也會將評分的因素考慮在內(nèi)。我們的算法顯著提高了被推薦物品的準確性,能夠使推薦更有效率,因此有很強的應用價值。3.本文設計了融合上下文信息的電子商務推薦系統(tǒng)框架,它是綜合了用戶具體屬性、用戶行為以及第三章中我們提出的上下文信息屬性,構(gòu)造N層笛卡爾積的屬性集合,運用邏輯回歸理論構(gòu)建了融合上下文屬性特征的電子商務網(wǎng)站推薦系統(tǒng)架構(gòu)。這個架構(gòu)是對全文推薦系統(tǒng)結(jié)構(gòu)的一種總結(jié),是綜合了電子商務網(wǎng)站特點與推薦系統(tǒng)特點的綜合產(chǎn)物。
[Abstract]:Along with the popularization of digital network information, network information carrying more and more. The recommendation system function is to allow users to quickly get the information they need in the vast amounts of data. All kinds of recommendation system also arises at the historic moment, but now most of the studies aimed at the recommended algorithm is the focus of the improved recommendation algorithm accuracy. However we are familiar with the situation is different, the user's needs are different, now people are living in a different social affairs, each place in the time node, different situation, will have different preferences. The context information of different users at different context and user's the recommendation system is not visible, this requires our recommendation system to ascertain the user's context, and to ascertain the real context according to the push Recommended, but attention to context recommender systems for this sensing function is still relatively low, as is the interactive process, many problems still need to make further research. Based on the context aware interaction recommended the main research work was as follows: 1. put forward a kind of interactive context aware recommendation algorithm. According to the real-time recommendation system, user context is in the changing circumstances, it is difficult to directly extract the user preference model for technical training. And the traditional user preferences in this context changing situation, the context information is completely invisible to the system. The discovery for the user context. And can use the recommendation list and user system interaction on the list of recommended feedback system model for discovery, this paper proposes a kind of interactive mode, can Dynamic discovery context changes, and updates the user preferences in the process model, and use this preference model to monitor possible deviation detection. In this paper, the recommendation list update is a dynamic random allocation optimization problem, this paper proposes a TP-Learning algorithm, this algorithm is a modified greedy algorithm, which is based on heuristic learning, can get a list of recommended maximum efficiency for users. This algorithm is capable of real-time to find user context changes, and real-time update of user preferences in accordance with the current context model, and the use of this mechanism to improve the performance of the.2. recommendation algorithm improved network structure recommendation algorithm (NBI) is proposed two similar weight decay time and user based recommendation algorithm (TUserCF). Two recommendation algorithm based on graph is each user node The point was given the resources value to adjacent nodes, we should take into account the goods time factors for our users; the algorithm is the social network of factors based on the relationship between users. We extend the problem of resources allocation for value, the first consideration is the scoring matrix the second is the impact between the user and the user's interest set, friends set parameters, and for the time attenuation is described, and the weighted change process distribution coefficient is introduced based on the time attenuation. Finally, according to the last resource values are recommended, but the resources of the recommended value will also score into account. Our algorithm significantly improves the accuracy of recommended items, can make the recommendation more efficiency, so it has strong application value of.3. is designed in this paper on the integration The electronic commerce recommendation system framework, it is a combination of a specific user attributes, context information of user behavior and attributes in the third chapter, we put forward the attribute structure of N layer of Cartesian product of a set of regression theory to construct the e-commerce website integration context attributes recommendation system architecture application logic. This architecture is a summary of recommendations the system structure of the whole thesis, is the integrative product of e-commerce website features and characteristics of the recommendation system.

【學位授予單位】：山東師范大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP391.3

【參考文獻】

相關(guān)期刊論文 前10條

1 原福永;蔡紅蕾;李莉;;加入用戶偏好的非均勻資源分配推薦算法[J];小型微型計算機系統(tǒng);2015年02期

2 史加榮;鄭秀云;周水生;;矩陣補全算法研究進展[J];計算機科學;2014年04期

3 王茜;段雙艷;;一種改進的基于二部圖網(wǎng)絡結(jié)構(gòu)的推薦算法[J];計算機應用研究;2013年03期

4 朱銳;王懷民;馮大為;;基于偏好推薦的可信服務選擇[J];軟件學報;2011年05期

5 王玉祥;喬秀全;李曉峰;孟洛明;;上下文感知的移動社交網(wǎng)絡服務選擇機制研究[J];計算機學報;2010年11期

6 吳湖;王永吉;王哲;王秀利;杜栓柱;;兩階段聯(lián)合聚類協(xié)同過濾算法[J];軟件學報;2010年05期

7 許海玲;吳瀟;李曉東;閻保平;;互聯(lián)網(wǎng)推薦系統(tǒng)比較研究[J];軟件學報;2009年02期

8 孫小華;陳洪;孔繁勝;;在協(xié)同過濾中結(jié)合奇異值分解與最近鄰方法[J];計算機應用研究;2006年09期

9 鄧愛林,朱揚勇,施伯樂;基于項目評分預測的協(xié)同過濾推薦算法[J];軟件學報;2003年09期

10 曾春,邢春曉,周立柱;個性化服務技術(shù)綜述[J];軟件學報;2002年10期

，

本文編號：1630146