CN111737427A - A MOOC forum post recommendation method integrating forum interaction behavior and user reading preference - Google Patents
A MOOC forum post recommendation method integrating forum interaction behavior and user reading preference Download PDFInfo
- Publication number
- CN111737427A CN111737427A CN202010391330.3A CN202010391330A CN111737427A CN 111737427 A CN111737427 A CN 111737427A CN 202010391330 A CN202010391330 A CN 202010391330A CN 111737427 A CN111737427 A CN 111737427A
- Authority
- CN
- China
- Prior art keywords
- user
- matrix
- post
- interaction
- forum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3329—Natural language query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
- G06F16/3346—Query execution using probabilistic model
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/335—Filtering based on additional data, e.g. user or group profiles
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Artificial Intelligence (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
技术领域technical field
本发明涉及教学教育数据挖掘与自然语言处理的技术领域,尤其是指一种融合论坛互动行为与用户阅读偏好的慕课论坛帖推荐方法。The invention relates to the technical field of teaching and education data mining and natural language processing, in particular to a MOOC forum post recommendation method integrating forum interaction behavior and user reading preference.
背景技术Background technique
在网络信息高速传播与计算机技术快速发展的时代,在线学习平台使得新一代网民可随时随地学习各大名校课程。大规模开放性课程(Massive Open Online Course,简称慕课)更是吸引了成千上万的学者。至2018年初,我国学习人数突破7000万人次。虽然学习人数众多,但由于慕课本身的开放性,学员水平的参差不齐、学习目的各异,使得慕课的退课率高,参与度低。慕课论坛作为促进学生进行知识交流、促进课程参与的重要模块,对降低退课率有一定的作用。In the era of high-speed dissemination of network information and rapid development of computer technology, online learning platforms enable a new generation of netizens to study courses from prestigious universities anytime, anywhere. Massive Open Online Courses (MOOCs) have attracted thousands of scholars. By the beginning of 2018, the number of students studying in my country exceeded 70 million. Although there are a large number of students, due to the openness of the MOOC itself, the level of students is uneven, and the learning objectives are different, which makes the MOOC's dropout rate high and the participation low. As an important module to promote students' knowledge exchange and course participation, MOOC forums play a certain role in reducing the dropout rate.
慕课论坛存在信息负载不均衡、“信息迷航”的问题。尽管现阶段大部分慕课平台以子版块来组织论坛,却无法保证学生能为发表的内容选择相应的子版块,信息混乱问题仍然存在。另一方面,论坛的单一排序机制使得很多新问题在还未被完整解答的之前就被其他帖子淹没,未回答率较高。一一回应论坛帖给教师、助教带来了较大的信息负载。理想的情况下,论坛的信息负载是均衡的,学生之间可以热烈讨论,而不单纯依赖老师来解答问题;学生可以是回答彼此问题的资源,在论坛中相互协助,成为共享知识的学习群体。慕课论坛需要一种个性化的推荐技术,结合学生的阅读偏好和互动情况,实现信息“路由”。现有的慕课论坛帖推荐算法采用如LDA主题模型、词共现统计,关联词等较为传统的方法提取用户阅读偏好,然而主题模型等传统方法难以结合用户行为信息进行端到端推荐,推荐精准度不高。另一方面,现有技术缺乏考虑慕课论坛帖推荐用户活跃度低的场景,没有针对冷启动问题提出解决方案。There are problems of unbalanced information load and "information trek" in MOOC forums. Although most MOOC platforms organize forums with sub-sections at this stage, there is no guarantee that students can choose corresponding sub-sections for their published content, and the problem of information confusion still exists. On the other hand, the single sorting mechanism of the forum makes many new questions flooded by other posts before they are fully answered, and the unanswered rate is high. Responding to forum posts one by one brings a large information load to teachers and teaching assistants. Ideally, the information load of the forum is balanced, and students can have lively discussions, instead of relying solely on teachers to answer questions; students can be a resource to answer each other's questions, assist each other in the forum, and become a learning group sharing knowledge. . MOOC forums need a personalized recommendation technology that combines students' reading preferences and interaction to realize information "routing". The existing MOOC forum post recommendation algorithms use traditional methods such as LDA topic model, word co-occurrence statistics, and associated words to extract user reading preferences. However, traditional methods such as topic model are difficult to combine user behavior information for end-to-end recommendation, and the recommendation is accurate. The degree is not high. On the other hand, the prior art lacks considering the scenarios of low user activity recommended by MOOC forum posts, and does not propose a solution to the cold start problem.
本发明提出融合论坛互动行为与用户阅读偏好的推荐方法,目标在于改进现有慕课论坛帖推荐技术推荐精度不高、未充分考虑用户冷启动的技术缺陷,在考虑用户阅读偏好的同时,通过深度学习和基于概率的矩阵分解,将用户与帖子、用户与用户之间细微交互的信息融入到模型中,更加完整地刻画用户偏好,缓解冷启动问题,实现精准推荐。The present invention proposes a recommendation method that integrates forum interaction behavior and user reading preference, and aims to improve the technical defects of the existing MOOC forum post recommendation technology that recommendation accuracy is not high and the user's cold start is not fully considered. Deep learning and probability-based matrix decomposition integrate the information of subtle interactions between users and posts, and users and users into the model to more completely describe user preferences, alleviate the cold start problem, and achieve accurate recommendation.
发明内容SUMMARY OF THE INVENTION
本发明的目的在于改进现有慕课论坛帖推荐技术推荐精度不高、未充分考虑用户冷启动的技术缺陷,提出了一种融合论坛互动行为与用户阅读偏好的慕课论坛帖推荐方法,在考虑用户阅读偏好的同时,通过深度学习和基于概率的矩阵分解,将用户与帖子、用户与用户之间细微交互的信息融入到模型中,更加完整地刻画用户偏好,缓解冷启动问题,为慕课学员推荐感兴趣的论坛帖,促进论坛互动。The purpose of the present invention is to improve the technical defects of the existing MOOC forum post recommendation technology that the recommendation accuracy is not high and the user's cold start is not fully considered, and proposes a MOOC forum post recommendation method that integrates the forum interaction behavior and the user's reading preference. While considering users' reading preferences, through deep learning and probability-based matrix decomposition, the information of the subtle interaction between users and posts, users and users is integrated into the model, which more completely describes user preferences and alleviates the cold start problem. Course students recommend forum posts of interest to promote forum interaction.
为实现上述目的,本发明所提供的技术方案为:融合论坛互动行为与用户阅读偏好的慕课论坛帖推荐方法,包括以下步骤:In order to achieve the above purpose, the technical solution provided by the present invention is: a method for recommending MOOC forum posts that integrates forum interactive behavior and user reading preference, including the following steps:
1)利用用户在论坛中的浏览记录,构建用户对帖子的目标评分矩阵、用户互动评分矩阵和用户互动频次矩阵;1) Use the user's browsing records in the forum to construct the user's target score matrix, user interaction score matrix and user interaction frequency matrix for posts;
2)引入矩阵Ua和Ub,利用用户互动频次矩阵作为约束项,分解用户互动评分矩阵,得到用户目标函数,将Ua和Ub相加,作为用户行为特征矩阵;2) Introduce matrices U a and U b , use the user interaction frequency matrix as a constraint item, decompose the user interaction rating matrix, obtain the user objective function, and add U a and U b as the user behavior characteristic matrix;
3)统计用户的各种互动行为次数,与对应的用户ID构建用户嵌入矩阵,拼接用户行为特征矩阵和用户嵌入矩阵,得到用户矩阵U;3) Count the times of various interactive behaviors of the user, construct a user embedding matrix with the corresponding user ID, splicing the user behavior characteristic matrix and the user embedding matrix, and obtain the user matrix U;
4)整合用户的历史帖,引入物品矩阵V,通过降噪自编码器提取帖子的主题,得到物品目标函数,利用用户矩阵U和物品矩阵V分解目标评分矩阵,得到评分矩阵目标函数;4) Integrate the user's historical posts, introduce the item matrix V, extract the subject of the post through the noise reduction autoencoder, obtain the item objective function, and use the user matrix U and the item matrix V to decompose the target scoring matrix to obtain the scoring matrix objective function;
5)优化评分矩阵目标函数、用户目标函数和物品目标函数,为用户提供推荐列表。5) Optimize the scoring matrix objective function, user objective function and item objective function to provide users with a recommendation list.
在步骤1)中,目标评分矩阵为二维矩阵,矩阵的横向为用户ID,矩阵的列项为帖子ID,矩阵的数值标识用户对帖子的兴趣与否,将用户对帖子的评分设为1,表示用户浏览过对应的帖子,且默认用户可能对帖子的主题感兴趣,将用户对帖子的评分设为0,表示用户未浏览过对应的帖子,且默认用户可能对该帖子的主题不感兴趣;用户互动评分矩阵和用户互动频次矩阵均为二维矩阵,分别标识用户之间是否有过互动以及互动的总次数,所述互动包括用户之间的回复、评论、点赞和浏览行为,若用户之间发生互动,则用户互动评分矩阵对应的值为1,否则为0,用户互动频次矩阵所对应的值为用户发生互动行为的次数。In step 1), the target rating matrix is a two-dimensional matrix, the horizontal direction of the matrix is the user ID, the column item of the matrix is the post ID, the value of the matrix identifies whether the user is interested in the post or not, and the user's score for the post is set to 1 , indicating that the user has browsed the corresponding post, and the default user may be interested in the subject of the post, and setting the user's score to 0 means that the user has not browsed the corresponding post, and the default user may not be interested in the subject of the post ; The user interaction rating matrix and the user interaction frequency matrix are both two-dimensional matrices, which respectively identify whether there has been interaction between users and the total number of interactions. The interaction includes replies, comments, likes and browsing behaviors between users. When there is interaction between users, the value corresponding to the user interaction score matrix is 1, otherwise it is 0, and the value corresponding to the user interaction frequency matrix is the number of times the user has interacted.
在步骤2)中,得到用户目标函数和用户特征矩阵,包括如下步骤:In step 2), obtain the user objective function and the user feature matrix, including the following steps:
2.1)引入矩阵Ua和Ub,假设Ua和Ub的每一行服从如下高斯分布:2.1) Introduce matrices U a and U b , assuming that each row of U a and U b obeys the following Gaussian distribution:
式中,i表示矩阵的每一行,为超参数λa的倒数,为超参数λb的倒数;where i represents each row of the matrix, is the reciprocal of the hyperparameter λ a , is the reciprocal of the hyperparameter λ b ;
2.2)记用户互动评分矩阵为Q,用户互动频次矩阵为C,假设Q中的每个值服从如下式的高斯分布:2.2) Denote the user interaction rating matrix as Q and the user interaction frequency matrix as C, assuming that each value in Q obeys the Gaussian distribution of the following formula:
式中,Qij为用户互动评分矩阵第i行,第j列的项值,为矩阵Ua第i行的向量,和为矩阵Ub第j列的向量,C-1为用户互动频次矩阵C的逆矩阵,是上式高斯分布的方差;In the formula, Q ij is the item value of the i-th row and the j-th column of the user interaction rating matrix, is the vector of the ith row of matrix U a , and is the vector of the jth column of the matrix U b , C -1 is the inverse matrix of the user interaction frequency matrix C, and is the variance of the Gaussian distribution of the above formula;
2.3)根据基于概率的矩阵分解方法,得到推导公式:2.3) According to the probability-based matrix decomposition method, the derivation formula is obtained:
式中,P(|)表示后验概率,∝表示正比关系;In the formula, P(|) represents the posterior probability, and ∝ represents the proportional relationship;
代入Q,Ua,Ub的高斯分布,推导得到用户目标函数;Substitute into the Gaussian distribution of Q, U a , U b , and derive the user objective function;
2.4)将Ua和Ub相加,得到用户行为特征矩阵。2.4) Add U a and U b to obtain the user behavior characteristic matrix.
在步骤3)中,统计用户的各种互动行为次数包括统计用户的被点赞次数、被浏览量、被回复数、回复数、发帖数和被关注数,与对应的用户ID构建用户嵌入矩阵,拼接用户行为特征矩阵和用户嵌入矩阵,得到用户矩阵U,包括如下步骤:In step 3), counting the number of various interactive behaviors of the user includes counting the number of likes, pageviews, replies, replies, postings, and followings of the user, and constructs a user embedding matrix with the corresponding user ID , splicing the user behavior feature matrix and the user embedding matrix to obtain the user matrix U, including the following steps:
3.1)将各种互动行为次数离散化,得到6个离散化特征;3.1) Discretize the times of various interactive behaviors to obtain 6 discrete features;
3.2)将6个离散化特征与用户ID作为模型嵌入层的输入,获得7个嵌入向量;3.2) Take the 6 discretized features and the user ID as the input of the model embedding layer, and obtain 7 embedding vectors;
3.3)将7个嵌入向量拼接后作为用户的嵌入层向量,所有用户的嵌入层向量构成用户嵌入矩阵Uc;3.3) after splicing 7 embedding vectors as the user's embedding layer vector, the embedding layer vectors of all users constitute the user embedding matrix U c ;
3.4)拼接用户行为特征矩阵和用户嵌入矩阵Uc,按照下式构建用户矩阵U:3.4) Splicing the user behavior feature matrix and the user embedding matrix U c , and constructing the user matrix U according to the following formula:
式中,符号[;]表示拼接操作,Ua+Ub为用户行为特征矩阵,Uc为用户嵌入矩阵,为超参数λu的倒数,为高斯分布的方差。In the formula, the symbol [;] represents the splicing operation, U a + U b is the user behavior feature matrix, U c is the user embedding matrix, is the reciprocal of the hyperparameter λ u and is the variance of the Gaussian distribution.
在步骤4),得到物品目标函数和评分矩阵目标函数,包括如下步骤:In step 4), the item objective function and the scoring matrix objective function are obtained, including the following steps:
4.1)将论坛帖的标题、帖子具体描述和一系列历史回帖合成一条内容帖,对文本进行预处理;4.1) The title of the forum post, the specific description of the post and a series of historical replies are combined into a content post, and the text is preprocessed;
4.2)将每一条帖子的内容转换为位序编码,输入到嵌入层,或直接通过预训练词向量初始化文本的嵌入层,输出文本的嵌入表示;4.2) Convert the content of each post into bit-sequence encoding and input it to the embedding layer, or initialize the text embedding layer directly through the pre-trained word vector, and output the embedded representation of the text;
4.3)将文本的嵌入表示输入到降噪自编码器中,通过降噪自编码器还原输入信息,利用降噪自编码器的中间层,提取文本的主题向量降噪自编码器网络的权重服从如下高斯分布:4.3) Input the embedded representation of the text into the denoising autoencoder, restore the input information through the denoising autoencoder, and use the middle layer of the denoising autoencoder to extract the topic vector of the text The weights of the denoising autoencoder network obey the following Gaussian distribution:
式中,W为降噪自编码器每层的权重,为超参数λw的倒数,为高斯分布的方差;where W is the weight of each layer of the denoising autoencoder, is the inverse of the hyperparameter λw , and is the variance of the Gaussian distribution;
引入用户偏好ε,通过ε和主题向量构建如下物品矩阵V,使得物品矩阵V包含主题信息和用户偏好信息:The user preference ε is introduced, and the following item matrix V is constructed through ε and the topic vector, so that the item matrix V contains topic information and user preference information:
ε服从如下高斯分布:ε obeys the following Gaussian distribution:
式中,为超参数λv的倒数,为高斯分布的方差;In the formula, is the reciprocal of the hyperparameter λ v , and is the variance of the Gaussian distribution;
4.4)利用降噪自编码器还原输入信息,代入W,V,ε的表达式,得到物品目标函数;4.4) Use the noise reduction autoencoder to restore the input information, and substitute the expressions of W, V, ε to obtain the object objective function;
4.5)通过下式,利用用户矩阵U和物品矩阵V分解目标评分矩阵:4.5) Decompose the target rating matrix using the user matrix U and the item matrix V by the following formula:
式中,Rij为目标评分矩阵第i行,第j列的项值;Ui表示用户矩阵U的第i行,Vj表示物品矩阵V的第j行,为超参数λr的倒数,为高斯分布的方差;In the formula, R ij is the item value of the ith row and jth column of the target rating matrix; U i represents the ith row of the user matrix U, V j represents the jth row of the item matrix V, is the reciprocal of the hyperparameter λr , and is the variance of the Gaussian distribution;
根据基于概率的矩阵分解方法,得到评分矩阵目标函数。According to the probability-based matrix factorization method, the scoring matrix objective function is obtained.
在步骤5)中,优化评分矩阵目标函数、用户目标函数和物品目标函数,在预设的训练阈值内,修正用户矩阵U和物品矩阵V的表示,将最终用户矩阵和物品矩阵点乘,从点乘的结果中检索目标用户对一系列物品的评分,通过对每个用户的评分列表进行排序,得到对应前M个评分高的帖子,为用户提供推荐列表。In step 5), the scoring matrix objective function, the user objective function and the item objective function are optimized, within the preset training threshold, the representation of the user matrix U and the item matrix V is corrected, and the final user matrix and the item matrix are dot-multiplied, from In the result of the dot product, the target user's score for a series of items is retrieved, and by sorting the score list of each user, the corresponding top M posts with high scores are obtained, and a recommendation list is provided for the user.
本发明与现有技术相比,具有如下优点与有益效果:Compared with the prior art, the present invention has the following advantages and beneficial effects:
1、本发明利用降噪自编码器提取文本的主题信息,对比于相关方法,该方法可以利用深度学习在自然语言处理的优势,更好地挖掘用户阅读偏好。1. The present invention uses the noise reduction autoencoder to extract the subject information of the text. Compared with the related methods, this method can utilize the advantages of deep learning in natural language processing to better mine the user's reading preference.
2、本发明利用基于概率的矩阵分解方法分解用户论坛互动评分矩阵,可以在只有少数互动,通过稀疏矩阵的分解提取用户行为特征,在一定程度缓解冷启动问题。2. The present invention uses a probability-based matrix decomposition method to decompose the user forum interaction rating matrix, and can extract user behavior characteristics through the decomposition of the sparse matrix when there are only a few interactions, so as to alleviate the cold start problem to a certain extent.
3、针对文本主题模型难以结合用户行为信息进行端到端推荐的问题,本发明通过深度学习和基于概率的矩阵分解方法,将论坛互动信息与主题模型融合,实现端到端精准推荐。3. Aiming at the problem that the text topic model is difficult to perform end-to-end recommendation in combination with user behavior information, the present invention integrates forum interaction information with the topic model through deep learning and a probability-based matrix decomposition method to achieve end-to-end accurate recommendation.
4、本发明的模型具有可扩展性,支持多种用户信息嵌入。4. The model of the present invention is scalable and supports multiple user information embedding.
附图说明Description of drawings
图1为本发明方法的逻辑流程图。Figure 1 is a logic flow diagram of the method of the present invention.
图2为本发明的用户互动矩阵分解解析图。FIG. 2 is a decomposition analysis diagram of a user interaction matrix of the present invention.
图3为本发明的论坛帖推荐模型图。FIG. 3 is a diagram of a forum post recommendation model of the present invention.
图4为本发明利用降噪自编码器提取文本隐向量示意图。FIG. 4 is a schematic diagram of extracting text latent vectors by using noise reduction autoencoder according to the present invention.
具体实施方式Detailed ways
下面结合具体实施例对本发明作进一步说明。The present invention will be further described below in conjunction with specific embodiments.
如图1所示,本实施例所提供的融合论坛互动行为与用户阅读偏好的慕课论坛帖推荐方法,包括以下步骤:As shown in FIG. 1 , the method for recommending MOOC forum posts that integrates forum interaction behaviors and user reading preferences provided by this embodiment includes the following steps:
1)构建目标评分矩阵,目标评分矩阵为二维矩阵,矩阵的横向为用户ID,矩阵的列项为帖子ID,矩阵的数值标识用户对帖子的兴趣与否,将用户对帖子的评分设为1,表示用户浏览过对应的帖子,且默认用户可能对帖子的主题感兴趣,将用户对帖子的评分设为0,表示用户未浏览过对应的帖子,且默认用户可能对该帖子的主题不感兴趣。1) Construct the target score matrix, the target score matrix is a two-dimensional matrix, the horizontal direction of the matrix is the user ID, the column item of the matrix is the post ID, and the value of the matrix identifies whether the user is interested in the post, and the user's score for the post is set as 1. It means that the user has browsed the corresponding post, and the default user may be interested in the subject of the post. Setting the user's score to 0 means that the user has not browsed the corresponding post, and the default user may not be interested in the subject of the post. interest.
由于论坛存在很多未回复的帖子,目标评分矩阵会非常稀疏,即矩阵中大部分评分为0,需对原始数据进行过滤,去除字数过少、含特殊符号较多的帖子,设置用户浏览量阈值,去除浏览帖数目小于阈值的用户,这样能够去除掉一些“僵尸”用户和“垃圾”帖。之后开始构建评分矩阵,并按照一定的负采样比例,随机删除矩阵中值为0的项。具体可使用与原矩阵有相同行列的掩码矩阵,使用1标识原始矩阵中需要保留的项,使用0标识原始矩阵需要删除的评分为0的项,根据负采样比例提前计算好掩码矩阵,将掩码矩阵和原始评分矩阵进行“与”操作,即可得到降采样矩阵。降采样矩阵是后续输入到模型的实际数据。Since there are many unanswered posts in the forum, the target score matrix will be very sparse, that is, most of the scores in the matrix are 0. The original data needs to be filtered to remove posts with too few words and many special symbols, and set the user pageview threshold. , remove users whose number of browsing posts is less than the threshold, so as to remove some "zombie" users and "spam" posts. After that, the scoring matrix is constructed, and according to a certain negative sampling ratio, the items with a value of 0 in the matrix are randomly deleted. Specifically, a mask matrix with the same rows and columns as the original matrix can be used, 1 is used to identify the items that need to be retained in the original matrix, and 0 is used to identify the items with a score of 0 that need to be deleted from the original matrix, and the mask matrix is calculated in advance according to the negative sampling ratio. The downsampling matrix is obtained by ANDing the mask matrix with the original score matrix. The downsampling matrix is the actual data that is subsequently fed into the model.
利用过滤后的数据构建用户互动评分矩阵和互动频次矩阵,它们也都是二维矩阵,分别标识用户之间是否有过互动以及互动的总次数,所述互动包括用户之间的回复、评论、点赞、浏览行为,若用户之间发生所述互动,则用户互动评分矩阵对应的值为1,否则为0,用户互动频次矩阵所对应的值为用户发生互动行为的次数。Use the filtered data to construct a user interaction rating matrix and an interaction frequency matrix. They are also two-dimensional matrices, which respectively identify whether there has been interaction between users and the total number of interactions. The interaction includes replies, comments, Like and browse behaviors, if the interaction occurs between users, the value corresponding to the user interaction score matrix is 1, otherwise it is 0, and the value corresponding to the user interaction frequency matrix is the number of times the user has interacted.
2)获得用户目标函数和用户特征矩阵,包括如下步骤:2) Obtain the user objective function and the user feature matrix, including the following steps:
2.1)引入矩阵Ua和Ub,假设Ua和Ub的每一行服从如下高斯分布:2.1) Introduce matrices U a and U b , assuming that each row of U a and U b obeys the following Gaussian distribution:
式中,i表示矩阵的每一行,为超参数λa的倒数,为超参数λb的倒数。where i represents each row of the matrix, is the reciprocal of the hyperparameter λ a , is the inverse of the hyperparameter λb .
2.2)记用户互动评分矩阵为Q,用户互动频次矩阵为C,假设Q中的每个值服从如下式的高斯分布:2.2) Denote the user interaction rating matrix as Q and the user interaction frequency matrix as C, assuming that each value in Q obeys the Gaussian distribution of the following formula:
式中,Qij为用户互动评分矩阵第i行,第j列的项值,为矩阵Ua第i行的向量,和为矩阵Ub第j列的向量,C-1为用户互动频次矩阵C的逆矩阵,是上式高斯分布的方差;将用户互动频次矩阵作为方差,能够使得用户互动的次数越多,对应项的惩罚越大,即用户在论坛中越活跃,对其特征表示的准确性要求越高。In the formula, Q ij is the item value of the i-th row and the j-th column of the user interaction rating matrix, is the vector of the ith row of matrix U a , and is the vector of the jth column of the matrix U b , C -1 is the inverse matrix of the user interaction frequency matrix C, which is the variance of the Gaussian distribution of the above formula; taking the user interaction frequency matrix as the variance, the more times the user interacts, the corresponding item The greater the penalty, that is, the more active the user is in the forum, the higher the requirement for the accuracy of its feature representation.
2.3)根据最大后验概率,得到推导公式:2.3) According to the maximum posterior probability, the derivation formula is obtained:
式中,P(|)表示后验概率,∝表示正比关系;In the formula, P(|) represents the posterior probability, and ∝ represents the proportional relationship;
注意到上述Q是可由用户互动行为统计得到的,是已知的观测结果,因此上述问题等同于利用已知观测Q,反推最具有可能导致此观测结果的模型参数Ua和Ub。由此,可通过引入Ua和Ub的先验分布,即高斯分布,从而利用最大似然估计,计算Ua和Ub的最大后验概率,得到用户目标函数。Note that the above Q can be obtained from the statistics of user interaction behavior and is a known observation, so the above problem is equivalent to using the known observation Q to infer the model parameters U a and U b that are most likely to lead to this observation. Therefore, by introducing the prior distribution of U a and U b , that is, the Gaussian distribution, maximum likelihood estimation can be used to calculate the maximum posterior probability of U a and U b to obtain the user objective function.
2.4)由于Ua和Ub是用户互动评分矩阵分解的结果,它们分别包含了矩阵横向和列项的信息,如图2所示,用户互动评分矩阵的列项表示用户的主动回复行为,描述了用户在论坛中积极主动的特性,横项表示其他用户对该用户的回复行为,描述了用户在论坛中的被动行为特性。将Ua和Ub相加,得到用户行为特征矩阵,使得改结果包含用户主动和被动行为的信息。2.4) Since U a and U b are the results of the decomposition of the user interaction rating matrix, they contain the information of the matrix horizontal and column items, respectively. As shown in Figure 2, the column items of the user interaction rating matrix represent the user's active response behavior. It reflects the active and active characteristics of users in the forum, and the horizontal item represents the response behavior of other users to the user, and describes the passive behavior characteristics of users in the forum. Add U a and U b to get the user behavior characteristic matrix, so that the result contains the information of the user's active and passive behavior.
3)统计用户的各种互动行为次数包括统计用户的被点赞次数、被浏览量、被回复数、回复数、发帖数和被关注数,与对应的用户ID构建用户嵌入矩阵,拼接用户行为特征矩阵和用户嵌入矩阵,得到用户矩阵U,包括如下步骤:3) Counting the number of users' various interactive behaviors, including counting the number of likes, pageviews, replies, replies, posts, and followers, and constructing a user embedding matrix with the corresponding user ID, splicing user behaviors The feature matrix and the user embedding matrix are obtained to obtain the user matrix U, including the following steps:
3.1)将各种互动行为次数(数值)离散化,得到6个离散化特征;以分箱离散化为例,假设用户被点赞数的样本点={12,13,24,4,5,34,56,98,8},分箱间隔为5,则离散化后的数据={3,3,5,1,1,7,12,20,2}。分箱间隔可根据数据的直方图来确定,一般设置为使数据分布较为均匀的数值。3.1) Discretize the times (numerical values) of various interactive behaviors to obtain 6 discrete features; take the binning discretization as an example, assuming that the sample points of the number of likes of the user = {12, 13, 24, 4, 5, 34, 56, 98, 8}, the binning interval is 5, then the discretized data = {3, 3, 5, 1, 1, 7, 12, 20, 2}. The binning interval can be determined according to the histogram of the data, and is generally set to a value that makes the data distribution more uniform.
3.2)将6个离散化特征与用户ID作为模型嵌入层的输入,获得7个嵌入向量;其中模型的嵌入层的输出维度可根据数据的分布范围自行调整,若离散后数值不大,则维度可设置小一些,具体维度数值可参照图3。3.2) Take the 6 discretized features and user ID as the input of the model embedding layer, and obtain 7 embedding vectors; the output dimension of the embedding layer of the model can be adjusted according to the distribution range of the data. If the value after discretization is not large, the dimension It can be set to be smaller. For specific dimension values, please refer to Figure 3.
3.3)将7个嵌入向量拼接后作为用户的嵌入层向量,所有用户的嵌入层向量构成用户嵌入矩阵Uc。3.3) The 7 embedding vectors are spliced as the user's embedding layer vector, and the embedding layer vectors of all users constitute the user embedding matrix U c .
3.4)拼接用户行为特征矩阵和用户嵌入矩阵Uc,按照下式构建用户矩阵U:3.4) Splicing the user behavior feature matrix and the user embedding matrix U c , and constructing the user matrix U according to the following formula:
式中,符号[;]表示拼接操作,Ua+Ub为用户行为特征矩阵,Uc为用户嵌入矩阵,为超参数λu的倒数,为高斯分布的方差。In the formula, the symbol [;] represents the splicing operation, U a + U b is the user behavior feature matrix, U c is the user embedding matrix, is the reciprocal of the hyperparameter λ u and is the variance of the Gaussian distribution.
4)得到物品目标函数和评分矩阵目标函数,包括如下步骤:4) Obtain the item objective function and the scoring matrix objective function, including the following steps:
4.1)将论坛帖的标题、帖子具体描述和一系列历史回帖合成一条内容帖,对文本进行预处理,具体步骤为:首先将论坛帖的标题、帖子具体描述和一系列历史回帖合成一条内容帖,之后对文本做预处理,包括标点与文字分隔、大小写转换、去除无意义标点字符、链接。4.1) Combine the title of the forum post, the specific description of the post and a series of historical replies into a content post, and preprocess the text. The specific steps are: first, combine the title of the forum post, the specific description of the post and a series of historical replies into a content post , and then preprocess the text, including punctuation and text separation, case conversion, removal of meaningless punctuation characters, and links.
4.2)将文本转换为位序编码,输入到嵌入层,或直接通过预训练词向量初始化文本的嵌入层。以位序编码为例,说明嵌入层的原理:假设帖子X={How many layers doesthe OSI model consist of?},X中的词在文本库中的位序为{How:899,many:1456,layer:600,does:3245,the:6723,OSI:28,model:876,consist:547,of:2323},则帖子X转为位序序列的表示为,X={899,1456,600,3245,6723,28,876,547,2323};假设嵌入层的维度为d,词库大小为m,则嵌入层将被随机初始化为大小为m×d的矩阵,因此帖子X中的词可通过位序索引,得到相应的词向量(嵌入向量)。当以文本预训练向量为输入时,可通过大规模公开的词嵌入,如Glove或Word2vec,获得文本每个词的词向量表示,初始化嵌入层矩阵。之后通过嵌入层输出文本的嵌入表示。具体的输出维度可自行定义,或参照图3进行设置。4.2) Convert the text to bit-sequence encoding and input it to the embedding layer, or initialize the text embedding layer directly through the pre-trained word vector. Take bit-sequence encoding as an example to illustrate the principle of the embedding layer: Suppose post X={How many layers does the OSI model consist of? }, the order of words in X in the text base is {How:899,many:1456,layer:600,does:3245,the:6723,OSI:28,model:876,consist:547,of:2323 }, then the representation of the post X into a sequence sequence is, X={899, 1456, 600, 3245, 6723, 28, 876, 547, 2323}; assuming that the dimension of the embedding layer is d and the size of the thesaurus is m, the embedding layer will is randomly initialized to a matrix of size m × d, so the words in post X can be indexed by bit order to get the corresponding word vector (embedding vector). When the text pre-training vector is used as input, the word vector representation of each word of the text can be obtained through a large-scale public word embedding, such as Glove or Word2vec, and the embedding layer matrix can be initialized. The embedded representation of the text is then output through the embedding layer. The specific output dimension can be defined by yourself, or set with reference to Figure 3.
4.3)将文本的嵌入表示输入到降噪自编码器中,如图4所示,降噪自编码器由多层前馈神经网络构成,包括编码层、中间层和解码层,每层网络的权重由下式的高斯分布随机初始化;降噪自编码器通过解码器,还原出文本的原始信息,在中间层通过更少的神经单元捕获文本的隐式描述,是文本更抽象、更少维度的信息表示,从可解释性层面来看,中间层的输出向量包含了文本的主题信息。4.3) Input the embedded representation of the text into the denoising autoencoder, as shown in Figure 4, the denoising autoencoder is composed of a multi-layer feedforward neural network, including an encoding layer, an intermediate layer and a decoding layer. The weight is randomly initialized by the Gaussian distribution of the following formula; the denoising autoencoder restores the original information of the text through the decoder, and captures the implicit description of the text through fewer neural units in the middle layer, making the text more abstract and less dimensional. The information representation of , from the interpretability level, the output vector of the middle layer Contains the subject information of the text.
式中,W为降噪自编码器每层的权重,为超参数λw的倒数,为高斯分布的方差;where W is the weight of each layer of the denoising autoencoder, is the inverse of the hyperparameter λw , and is the variance of the Gaussian distribution;
引入用户偏好ε,通过ε和主题向量构建如下物品矩阵V,使得物品矩阵包含主题信息和用户偏好信息:The user preference ε is introduced, and the following item matrix V is constructed by ε and the topic vector, so that the item matrix contains topic information and user preference information:
ε服从如下高斯分布:ε obeys the following Gaussian distribution:
式中,为超参数λv的倒数,为高斯分布的方差。In the formula, is the reciprocal of the hyperparameter λv , and is the variance of the Gaussian distribution.
4.4)利用降噪自编码器还原输入信息,代入W,V,ε的表达式,得到物品目标函数。4.4) Use the denoising autoencoder to restore the input information, and substitute the expressions of W, V, ε to obtain the item objective function.
4.5)通过下式,利用用户矩阵U和物品矩阵V分解目标评分矩阵:4.5) Decompose the target rating matrix using the user matrix U and the item matrix V by the following formula:
式中,Rij为目标评分矩阵第i行,第j列的项值,Ui表示用户矩阵U的第i行,Vj表示物品矩阵V的第j行,为超参数λr的倒数,为高斯分布的方差;In the formula, R ij is the item value of the ith row and jth column of the target rating matrix, U i represents the ith row of the user matrix U, V j represents the jth row of the item matrix V, is the reciprocal of the hyperparameter λr , and is the variance of the Gaussian distribution;
注意到上述R是通过统计得到的,是已知的观测结果,因此上述问题等同于利用已知观测R,反推最具有可能导致此观测结果的模型参数U和V,由此,可通过引入U和V的先验分布,从而利用最大似然估计,计算U和V的最大后验概率,得到评分矩阵目标函数。Note that the above R is obtained through statistics and is a known observation, so the above problem is equivalent to using the known observation R, inversely inferring the model parameters U and V that are most likely to lead to this observation. Therefore, by introducing The prior distribution of U and V, so as to use the maximum likelihood estimation to calculate the maximum posterior probability of U and V, and obtain the scoring matrix objective function.
通过图2和上述步骤可以看到,目标评分矩阵的分解预测涉及了用户阅读偏好提取、用户特征提取和用户互动矩阵分解,将各个组件融合到模型中,进行端到端推荐。As can be seen from Figure 2 and the above steps, the decomposition and prediction of the target rating matrix involves user reading preference extraction, user feature extraction and user interaction matrix decomposition, and each component is integrated into the model for end-to-end recommendation.
5)优化评分矩阵目标函数、用户目标函数、物品目标函数,为了最小化目标函数,可以利用业界成熟的优化器,如Adagrad,RMSprop,SGD,求解目标函数的梯度,使得模型的参数由反向传播得到更新,在一定的训练阈值内,修正用户矩阵U和物品矩阵V的表示,这个训练阈值一般可通过观察预测的结果的稳定和收敛程度进行设定,无固定设置值。5) Optimize the scoring matrix objective function, user objective function, and item objective function. In order to minimize the objective function, mature optimizers in the industry, such as Adagrad, RMSprop, and SGD, can be used to solve the gradient of the objective function, so that the parameters of the model are reversed. The propagation is updated, and the representation of the user matrix U and the item matrix V is corrected within a certain training threshold. This training threshold can generally be set by observing the stability and convergence of the predicted results, and there is no fixed setting value.
在达到阈值后,将最终用户矩阵和物品矩阵点乘,从点乘的结果中检索目标用户对一系列物品的评分,通过对每个用户的评分列表进行排序,得到对应前M个评分较高的帖子,为用户提供推荐列表。After reaching the threshold, the end-user matrix and the item matrix are dot-multiplied, and the target user's score for a series of items is retrieved from the result of dot-multiplication. By sorting the score list of each user, the corresponding top M scores are obtained. posts, providing users with a list of recommendations.
以上所述实施例只为本发明之较佳实施例,并非以此限制本发明的实施范围,故凡依本发明之形状、原理所作的变化,均应涵盖在本发明的保护范围内。The above-mentioned embodiments are only preferred embodiments of the present invention, and are not intended to limit the scope of implementation of the present invention. Therefore, any changes made according to the shape and principle of the present invention should be included within the protection scope of the present invention.
Claims (6)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010391330.3A CN111737427B (en) | 2020-05-11 | 2020-05-11 | Method for recommending lesson forum posts by combining forum interaction behaviors and user reading preference |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010391330.3A CN111737427B (en) | 2020-05-11 | 2020-05-11 | Method for recommending lesson forum posts by combining forum interaction behaviors and user reading preference |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111737427A true CN111737427A (en) | 2020-10-02 |
CN111737427B CN111737427B (en) | 2024-03-22 |
Family
ID=72647039
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010391330.3A Active CN111737427B (en) | 2020-05-11 | 2020-05-11 | Method for recommending lesson forum posts by combining forum interaction behaviors and user reading preference |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111737427B (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112966148A (en) * | 2021-03-05 | 2021-06-15 | 安徽师范大学 | Video recommendation method and system based on deep learning and feature fusion |
CN113449210A (en) * | 2021-07-01 | 2021-09-28 | 深圳市数字尾巴科技有限公司 | Personalized recommendation method and device based on space-time characteristics, electronic equipment and storage medium |
CN114996487A (en) * | 2022-05-24 | 2022-09-02 | 北京达佳互联信息技术有限公司 | Media resource recommendation method and device, electronic equipment and storage medium |
CN117312542A (en) * | 2023-11-29 | 2023-12-29 | 泰山学院 | Reading recommendation method and system based on artificial intelligence |
CN118096237A (en) * | 2024-03-08 | 2024-05-28 | 北京嘉华铭品牌策划有限公司广东分公司 | A deep learning-driven customer behavior prediction model |
US20240281613A1 (en) * | 2022-09-14 | 2024-08-22 | iCIMS, Inc. | Methods and apparatus for analyzing internal communication within an organization using natural language processing to recommend improved interactions and identify key personnel |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090299996A1 (en) * | 2008-06-03 | 2009-12-03 | Nec Laboratories America, Inc. | Recommender system with fast matrix factorization using infinite dimensions |
CN106951547A (en) * | 2017-03-27 | 2017-07-14 | 西安电子科技大学 | A kind of cross-domain recommendation method based on intersection user |
CN107273438A (en) * | 2017-05-24 | 2017-10-20 | 深圳大学 | A kind of recommendation method, device, equipment and storage medium |
CN110807154A (en) * | 2019-11-08 | 2020-02-18 | 内蒙古工业大学 | A recommendation method and system based on a hybrid deep learning model |
CN111127165A (en) * | 2019-12-26 | 2020-05-08 | 纪信智达(广州)信息技术有限公司 | Sequence recommendation method based on self-attention self-encoder |
-
2020
- 2020-05-11 CN CN202010391330.3A patent/CN111737427B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090299996A1 (en) * | 2008-06-03 | 2009-12-03 | Nec Laboratories America, Inc. | Recommender system with fast matrix factorization using infinite dimensions |
CN106951547A (en) * | 2017-03-27 | 2017-07-14 | 西安电子科技大学 | A kind of cross-domain recommendation method based on intersection user |
CN107273438A (en) * | 2017-05-24 | 2017-10-20 | 深圳大学 | A kind of recommendation method, device, equipment and storage medium |
CN110807154A (en) * | 2019-11-08 | 2020-02-18 | 内蒙古工业大学 | A recommendation method and system based on a hybrid deep learning model |
CN111127165A (en) * | 2019-12-26 | 2020-05-08 | 纪信智达(广州)信息技术有限公司 | Sequence recommendation method based on self-attention self-encoder |
Non-Patent Citations (3)
Title |
---|
XU CHONGHUAN: "A novel recommendation method based on social network using matrix factorization technique", INFORMATION PROCESSING AND MANAGEMENT, vol. 54, 27 February 2018 (2018-02-27), pages 463 - 474 * |
欧辉思 等: "面向跨领域的推荐系统研究现状与趋势", 小型微型计算机系统, no. 07, 31 July 2016 (2016-07-31), pages 1411 - 1416 * |
胡思才 等: "基于深度神经网络和概率矩阵分解的混合推荐算法", 四川大学学报(自然科学版), vol. 56, no. 06, 30 November 2019 (2019-11-30), pages 1033 - 1041 * |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112966148A (en) * | 2021-03-05 | 2021-06-15 | 安徽师范大学 | Video recommendation method and system based on deep learning and feature fusion |
CN113449210A (en) * | 2021-07-01 | 2021-09-28 | 深圳市数字尾巴科技有限公司 | Personalized recommendation method and device based on space-time characteristics, electronic equipment and storage medium |
CN113449210B (en) * | 2021-07-01 | 2023-01-31 | 深圳市数字尾巴科技有限公司 | Personalized recommendation method, device, electronic equipment and storage medium based on spatio-temporal features |
CN114996487A (en) * | 2022-05-24 | 2022-09-02 | 北京达佳互联信息技术有限公司 | Media resource recommendation method and device, electronic equipment and storage medium |
CN114996487B (en) * | 2022-05-24 | 2023-04-07 | 北京达佳互联信息技术有限公司 | Media resource recommendation method and device, electronic equipment and storage medium |
US20240281613A1 (en) * | 2022-09-14 | 2024-08-22 | iCIMS, Inc. | Methods and apparatus for analyzing internal communication within an organization using natural language processing to recommend improved interactions and identify key personnel |
CN117312542A (en) * | 2023-11-29 | 2023-12-29 | 泰山学院 | Reading recommendation method and system based on artificial intelligence |
CN117312542B (en) * | 2023-11-29 | 2024-02-13 | 泰山学院 | Reading recommendation method and system based on artificial intelligence |
CN118096237A (en) * | 2024-03-08 | 2024-05-28 | 北京嘉华铭品牌策划有限公司广东分公司 | A deep learning-driven customer behavior prediction model |
CN118096237B (en) * | 2024-03-08 | 2024-11-29 | 北京嘉华铭品牌策划有限公司 | A deep learning-driven customer behavior prediction model |
Also Published As
Publication number | Publication date |
---|---|
CN111737427B (en) | 2024-03-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Liu et al. | Ekt: Exercise-aware knowledge tracing for student performance prediction | |
Liu et al. | Content-oriented user modeling for personalized response ranking in chatbots | |
CN111737427A (en) | A MOOC forum post recommendation method integrating forum interaction behavior and user reading preference | |
CN108021616B (en) | A Community Question Answering Expert Recommendation Method Based on Recurrent Neural Network | |
CN113569001A (en) | Text processing method, apparatus, computer device, and computer-readable storage medium | |
CN101354714B (en) | A Question Recommendation Method Based on Probabilistic Latent Semantic Analysis | |
CN108573411A (en) | A Hybrid Recommendation Method Based on Deep Sentiment Analysis of User Reviews and Fusion of Multi-source Recommendation Views | |
CN112084335A (en) | Social media user account classification method based on information fusion | |
Wiegmann et al. | Celebrity profiling | |
CN119128275B (en) | An educational resource recommendation method and system based on artificial intelligence | |
Rokade et al. | Business intelligence analytics using sentiment analysis-a survey | |
CN112395494B (en) | Bidirectional dynamic recommendation system based on generation of countermeasure network | |
CN113741759B (en) | Comment information display method and device, computer equipment and storage medium | |
CN113011172A (en) | Text processing method and device, computer equipment and storage medium | |
Mrhar et al. | Toward a deep recommender system for MOOCs platforms | |
CN114756681A (en) | Evaluation text fine-grained suggestion mining method based on multi-attention fusion | |
CN113934846B (en) | Online forum topic modeling method combining behavior-emotion-time sequence | |
Al Bashaireh et al. | Towards a new indicator for evaluating universities based on twitter sentiment analysis | |
Shin et al. | Evaluating coherence in writing: Comparing the capacity of automated essay scoring technologies | |
CN118245598A (en) | A text classification model based on dual-channel feature extraction | |
CN111401525A (en) | Adaptive learning system and method based on deep learning | |
CN116561441A (en) | A method for characterizing the cognitive state of social network users based on self-attention neural network | |
Deepa et al. | An efficient deep learning based chatbot for GRIET | |
Amanatidis et al. | A convolutional neural network for sentiment analysis of TripAdvisor reviews | |
CN112749805A (en) | Online course recommendation method based on multiple entity relationships |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |