{"title":"A Matching Recommendation Mechanism Based on Deep Learning and Topic Model","authors":"Huang Guo, Rui Wang, Xiandi Jiang","doi":"10.1109/ACAIT56212.2022.10137800","DOIUrl":null,"url":null,"abstract":"In recent years, text recommendation has been widely used in various APPs as a key technology for users to quickly and accurately obtain relevant information. Traditional text recommendation cannot obtain the internal relationship between users and articles, and ignores the information generated by users. Therefore, this paper proposes a matching recommendation mechanism based on articles and comments. First introduce the word2vec word vector model, use the vector to measure the relative meaning between words, and construct the document vector and user distribution vector based on the word vector. Then, under the framework of the topic model, a joint deep learning method—long and short-term memory network LSTM, makes full use of the new model before and after the sentence to learn the document to update the word vector expression of the sentence and document vector. Among them, the conditional random field (CRF) model is added to train the tags to solve the problem of insufficient attention to key words. Finally, in the matching mechanism, the similar relationship among the topic distributions, the constructed document vector and the user vector are used for training. Compared with the current popular topic model TopicRNN method, topic word vector model LF-LDA method, topic vector-based text representation method and four methods of LF-LDA combined with Word2vec text representation, the experimental results show that the matching recommendation classification is obtained Improved and very robust, training time is greatly shortened, the algorithm in this paper is effective.","PeriodicalId":398228,"journal":{"name":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACAIT56212.2022.10137800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, text recommendation has been widely used in various APPs as a key technology for users to quickly and accurately obtain relevant information. Traditional text recommendation cannot obtain the internal relationship between users and articles, and ignores the information generated by users. Therefore, this paper proposes a matching recommendation mechanism based on articles and comments. First introduce the word2vec word vector model, use the vector to measure the relative meaning between words, and construct the document vector and user distribution vector based on the word vector. Then, under the framework of the topic model, a joint deep learning method—long and short-term memory network LSTM, makes full use of the new model before and after the sentence to learn the document to update the word vector expression of the sentence and document vector. Among them, the conditional random field (CRF) model is added to train the tags to solve the problem of insufficient attention to key words. Finally, in the matching mechanism, the similar relationship among the topic distributions, the constructed document vector and the user vector are used for training. Compared with the current popular topic model TopicRNN method, topic word vector model LF-LDA method, topic vector-based text representation method and four methods of LF-LDA combined with Word2vec text representation, the experimental results show that the matching recommendation classification is obtained Improved and very robust, training time is greatly shortened, the algorithm in this paper is effective.