Skip to content
naulon

Not checkedNot checked for notices yet.

Expert Recommendation Algorithm Combining Attention and Recurrent Neural Network

LYU Xiaoqi, JI Ke, CHEN Zhenxiang, SUN Runyuan, MA Kun, WU Jun, LI Yidong

Jisuanji kexue yu tansuo · 2022

doi:10.3778/j.issn.1673-9418.2102067 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Community question answering (CQA) has become the most important knowledge sharing and exchange platform on the Internet, effectively recommending massive questions raised by users to users who may answer them, and mining the questions that users are interested in is the core function of such platforms. Some expert recommendation algorithms for CQA have been proposed to improve the efficiency of platform answering, but most of the existing work focuses on matching user interests with question information, ignoring the dynamic change of user interests, which may seriously affect the quality of recommendation. This paper proposes an expert recommen-dation algorithm combining attention and recurrent neural network (RNN), which not only realizes deep feature coding of the question content, but also captures the dynamically changing user interest. First, the question encoder combines convolutional neural network (CNN) and Attention mechanism on the basis of pre-trained word embeddings to realize joint representation of deep feature of question title and bound topics. Then, the user encoder captures the dynamic interest using Bi-GRU model on the time series of user's historical answers to questions, and combines the user's fixed label information to represent the long-term interest. Finally, a recommendation result combining the user's dynamic interest and long-term interest is generated according to the similarity calculation of output vectors of two encoders. This paper conducts comparative experiments on different parameter configurations and different algorithms on real data from Zhihu. Experimental results show that the performance of the algorithm is significantly better than the current popular deep learning expert recommendation methods.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.