CN113420866B - Score prediction method based on dual generation countermeasure network - Google Patents
Score prediction method based on dual generation countermeasure network Download PDFInfo
- Publication number
- CN113420866B CN113420866B CN202110698814.7A CN202110698814A CN113420866B CN 113420866 B CN113420866 B CN 113420866B CN 202110698814 A CN202110698814 A CN 202110698814A CN 113420866 B CN113420866 B CN 113420866B
- Authority
- CN
- China
- Prior art keywords
- samples
- gan
- user
- sample generator
- negative sample
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/045—Combinations of networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Mathematical Physics (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biophysics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a scoring prediction method based on a dual-generation countermeasure network, which mainly relates to the field of deep learning; the method comprises the following steps: s1, dividing samples into three types, namely samples liked by a user, samples not purchased and samples disliked by the user; s2, two GANs are used, wherein G of the first GAN is a negative sample generator, G of the second GAN is a positive sample generator, and the negative sample generator is used for generating high-quality negative samples; s3, inputting the samples generated by the negative sample generator into the positive sample generator as additional marking data, and randomly selecting some samples which are not purchased as input into the negative sample generator to generate positive samples; s4, inputting a favorite purchase vector of a user by the second GAN and requiring to generate an output close to 0 on a negative sample element generated by the first GAN, and generating x (0 < x < 1) from a randomly sampled unpurced vector as much as possible; the method can improve the accuracy of the model on the recommendation prediction and the generalization force of the model.
Description
Technical Field
The invention relates to the field of deep learning, in particular to a scoring prediction method based on a dual-generation countermeasure network.
Background
Collaborative Filtering (CF) is one of the most mature recommendation technologies, and the similarity of scores among users is calculated based on the historical score records of the users, so as to establish a user preference model; the establishment of the user preference model is a key factor influencing the quality of the recommendation algorithm. When the user sparsely scores the recommended resource scoring matrix, a user model is difficult to establish; the problem of cold start can be brought when facing new users and new resources, and resource recommendation cannot be effectively completed. Therefore, how to build a user preference model by fully utilizing user and resource information, especially implicit information between them, has been a focus of research.
With the continuous development of deep learning, generation of antagonistic neural Networks (GAN) has been successfully applied to the field of recommendation. The generation of the countermeasure network is implemented by continuously gaming a generative model G (Generator) and a discriminant model D (Discriminator), so that G learns the distribution of data, and in the training process, the Generator tries to cheat the Discriminator and considers the data in the generative model to be real data. The discriminator attempts to correctly judge the true data. During GAN training, the generative model attempts to generate true data by inputting false data, while the discriminative model estimates the likelihood of the data being true or false (from the generative model). Finally, the discriminator cannot distinguish the data in the generator, and the generator can generate the data we need.
CFGAN is a very successful deep recommendation framework based on generating countermeasure networks and collaborative filtering. The CFGAN is a GAN framework which introduces GAN in the field of collaborative filtering, migrates the relation between implicit features and files to users and projects, adopts a vector mode to resist training in the aspect of data preprocessing and proposes a vector mode-based resist training. Since the data is easier to collect, it is planned to focus on CFs with implicit feedback. The generative model of CFGAN attempts to generate a true purchase vector. Likewise, D attempts to differentiate between the generated user purchase vector and the true purchase vector obtained from ground truth. The generator plays games with the discriminator by generating a vector similar to the purchase vector, but the final generator will train to obtain an all-1 vector, for this reason, a negative sampling technique is introduced into the CFGAN, and optimization is performed through a loss function, so that the generator G is ensured to learn that the purchased article of the user is 1, and the unpurchased article is 0, so as to generate a purchase vector which is not all-1. The CFGAN has achieved great success in performance, however, the selection of negative examples is too random, because in real life, articles that the user does not purchase often do not represent articles that the user does not like, but rather are articles that the user does not see, and meanwhile, the previous algorithms do not utilize information of samples that the user does not purchase in a data set, which results in a large amount of hidden information being wasted by the model, and the limit of the model performance is not reached.
Disclosure of Invention
The invention aims to solve the problems in the prior art, provides a scoring prediction method based on a dual-generation countermeasure network, utilizes user embedded information, enhances the intimacy between users and projects and between users, improves a model, and better adapts to the problems of data sparseness and user cold start so as to improve the precision of the model on recommendation prediction and the generalization force of the model.
In order to achieve the purpose, the invention is realized by the following technical scheme:
the scoring prediction method based on the dual-generation countermeasure network comprises the following steps:
s1, dividing samples into three types, namely samples liked by a user, samples not purchased and samples disliked by the user;
s2, two GANs are used, wherein G of the first GAN is a negative sample generator, G of the second GAN is a positive sample generator, and the negative sample generator is used for generating high-quality negative samples;
s3, inputting the samples generated by the negative sample generator into the positive sample generator as additional marking data, and randomly selecting some samples which are not purchased as input into the negative sample generator to generate positive samples;
and S4, inputting a favorite purchase vector of the user by the second GAN, requiring the negative sample element generated by the first GAN to generate an output close to 0, and generating x (0 < x < 1) by using the randomly sampled unpurchased vector as much as possible.
Compared with the prior art, the invention has the beneficial effects that:
1. the invention fully utilizes the user embedded matrix and enhances the potential relationship between users; the negative sample and the generated countermeasure network are combined, so that the accuracy of the model is improved; samples which are not purchased by a user are utilized, so that the model is applied to the implicit relation between user items;
2. the invention provides a general CF frame name DGAN based on GAN, which makes full use of the implicit information of user-resource, uses the unpurchased items, and proves the effectiveness of the implicit information used by the invention through comparison experiments; the experimental results obtained by carrying out a large number of experimental verifications on the two data sets not only prove the effectiveness of the invention, but also prove the superiority of the invention, and compared with the latest top-N, the accuracy is obviously improved.
Drawings
FIG. 1 is a general architecture diagram of the present invention;
FIG. 2 is a score prediction result (movielens-100K) based on the present invention and comparison algorithm;
FIG. 3 shows the score prediction results (movielens-1M) based on the present invention and comparison algorithm.
Detailed Description
The invention will be further illustrated with reference to the following specific examples. It should be understood that these examples are for illustrative purposes only and are not intended to limit the scope of the present invention. Further, it should be understood that various changes or modifications of the present invention may be made by those skilled in the art after reading the teaching of the present invention, and these equivalents also fall within the scope of the present application.
The embodiment is as follows: as shown in fig. 1, the scoring prediction method based on the dual generation countermeasure network of the present invention includes the steps of:
s1, dividing samples into three types, namely samples liked by a user, samples not purchased and samples disliked by the user;
s2, two GANs are used, wherein G of the first GAN is a negative sample generator, G of the second GAN is a positive sample generator, and the negative sample generator is used for generating high-quality negative samples;
s3, inputting the samples generated by the negative sample generator into the positive sample generator as additional marking data, and randomly selecting some samples which are not purchased as input into the negative sample generator to generate positive samples;
and S4, inputting a favorite purchase vector of the user by the second GAN, requiring the negative sample element generated by the first GAN to generate an output close to 0, and generating x (0 < x < 1) by using the randomly sampled unpurchased vector as much as possible.
Specifically, the method comprises the following steps:
1. negative sample generator
Collecting user historical data information, processing data, marking three different types of samples which are favorite samples, unpurchased samples and disliked samples of a user, and randomly selecting some samples which are disliked by the user as input to a negative sample generator.
2. Positive sample generator
Positive samples are generated by inputting the samples generated by the negative sample generator as additional marking data into the positive sample generator. The positive sample generator inputs the user's favorite purchase vector and requires the negative sample generator to generate an output close to 0 on the element, and simultaneously generates x (0 < x < 1) on the randomly sampled unpurchased vector as much as possible, thereby improving the accuracy of the scoring prediction model.
3. Scoring prediction recommendation model
Referring to fig. 1, a negative sample generator and a positive sample generator are fused and learned and score prediction is tested so as to better recommend favorite items for a user and improve user satisfaction.
The method comprises the following specific steps:
step 1: negative examples are extracted from the negative example generator.
Step 2: item scores are generated from the positive sample generator.
And 3, step 3: the negative and positive sample generators are fused and learned and the score predictions are tested.
4. The experiment proves that
2-3, using 2 data sets movielens-100K and movielens-1M, the following 7 comparison algorithms were used: itempop, BPR, MPR, CDAE, IRGAN, CFGAN, gauphGAN, thereby verifying that the model performance is better than other comparison recommendation algorithms.
Claims (1)
1. The scoring prediction method based on the dual generation countermeasure network is characterized by comprising the following steps of:
s1, dividing samples into three types, namely samples liked by a user, samples not purchased and samples disliked by the user;
s2, two GANs are used, wherein G of the first GAN is a negative sample generator, G of the second GAN is a positive sample generator, and the negative sample generator is used for generating high-quality negative samples;
s3, inputting the sample generated by the negative sample generator into the positive sample generator as additional marking data to generate a positive sample;
and S4, inputting a favorite purchase vector of the user by the second GAN, requiring to generate an output close to 0 on the negative sample element generated by the first GAN, and generating x as much as possible by using a vector formed by randomly sampled unpurchased commodities, wherein 0 < x < 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110698814.7A CN113420866B (en) | 2021-06-23 | 2021-06-23 | Score prediction method based on dual generation countermeasure network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110698814.7A CN113420866B (en) | 2021-06-23 | 2021-06-23 | Score prediction method based on dual generation countermeasure network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113420866A CN113420866A (en) | 2021-09-21 |
| CN113420866B true CN113420866B (en) | 2022-10-11 |
Family
ID=77716345
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110698814.7A Active CN113420866B (en) | 2021-06-23 | 2021-06-23 | Score prediction method based on dual generation countermeasure network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113420866B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116610857B (en) * | 2023-04-10 | 2024-05-03 | 南京邮电大学 | Personalized post recommendation method based on user preference for post popularity |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109657156A (en) * | 2019-01-22 | 2019-04-19 | 杭州师范大学 | A kind of personalized recommendation method generating confrontation network based on circulation |
| CN110442781A (en) * | 2019-06-28 | 2019-11-12 | 武汉大学 | It is a kind of based on generate confrontation network to grade ranked items recommended method |
| CN111382785A (en) * | 2020-03-04 | 2020-07-07 | 武汉精立电子技术有限公司 | GAN network model and method for realizing automatic cleaning and auxiliary marking of sample |
| CN111950619A (en) * | 2020-08-05 | 2020-11-17 | 东北林业大学 | Active learning method based on dual-generation countermeasure network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10991145B2 (en) * | 2018-11-13 | 2021-04-27 | Nec Corporation | Pose-variant 3D facial attribute generation |
| US11048980B2 (en) * | 2019-04-30 | 2021-06-29 | Agora Lab, Inc. | Optimizing supervised generative adversarial networks via latent space regularizations |
| CN111259264B (en) * | 2020-01-15 | 2021-11-16 | 电子科技大学 | Time sequence scoring prediction method based on generation countermeasure network |
-
2021
- 2021-06-23 CN CN202110698814.7A patent/CN113420866B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109657156A (en) * | 2019-01-22 | 2019-04-19 | 杭州师范大学 | A kind of personalized recommendation method generating confrontation network based on circulation |
| CN110442781A (en) * | 2019-06-28 | 2019-11-12 | 武汉大学 | It is a kind of based on generate confrontation network to grade ranked items recommended method |
| CN111382785A (en) * | 2020-03-04 | 2020-07-07 | 武汉精立电子技术有限公司 | GAN network model and method for realizing automatic cleaning and auxiliary marking of sample |
| CN111950619A (en) * | 2020-08-05 | 2020-11-17 | 东北林业大学 | Active learning method based on dual-generation countermeasure network |
Non-Patent Citations (4)
| Title |
|---|
| Incorporating GAN for Negative Sampling in Knowledge Representation Learning;Peifeng Wang 等;《Thirty-Second AAAI Conference on Artificial Intelligence》;20180425;第32卷(第1期);2005-2012 * |
| 基于生成对抗网络的模仿学习综述;林嘉豪 等;《计算机学报》;20200229;第43卷(第2期);326-351 * |
| 基于跨模态语义挖掘与生成对抗网络的推荐系统研究;滑瑾;《中国优秀硕士学位论文全文数据库 信息科技辑》;20210315(第3期);I138-711 * |
| 生成对抗算法及其在对抗样本生成上的应用研究;黄钢;《中国优秀硕士学位论文全文数据库 信息科技辑》;20210315(第3期);I138-776 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113420866A (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110097094B (en) | Multiple semantic fusion few-sample classification method for character interaction | |
| CN110442790A (en) | Recommend method, apparatus, server and the storage medium of multi-medium data | |
| Ferstl et al. | ExpressGesture: Expressive gesture generation from speech through database matching | |
| US20140270497A1 (en) | Accurate text classification through selective use of image data | |
| CN107256494B (en) | Article recommendation method and device | |
| CN111460221B (en) | Comment information processing method and device and electronic equipment | |
| CN107797998A (en) | The recognition methods of user-generated content containing rumour and device | |
| WO2020135642A1 (en) | Model training method and apparatus employing generative adversarial network | |
| CN111666400B (en) | Message acquisition method, device, computer equipment and storage medium | |
| Ahuja et al. | Low-resource adaptation for personalized co-speech gesture generation | |
| Zhou et al. | Leveraging historical interaction data for improving conversational recommender system | |
| CN113420866B (en) | Score prediction method based on dual generation countermeasure network | |
| CN111259264B (en) | Time sequence scoring prediction method based on generation countermeasure network | |
| CN113449011A (en) | Big data prediction-based information push updating method and big data prediction system | |
| CN107749034A (en) | A kind of safe friend recommendation method in social networks | |
| CN112084307A (en) | Data processing method and device, server and computer readable storage medium | |
| CN111523940A (en) | Deep reinforcement learning-based recommendation method and system with negative feedback | |
| CN113641811B (en) | Session recommendation method, system, equipment and storage medium for promoting purchasing behavior | |
| CN110347853A (en) | A kind of image hash code generation method based on Recognition with Recurrent Neural Network | |
| CN109740743A (en) | Hierarchical neural network query recommendation method and device | |
| Yang | [Retracted] A Deep Learning and Clustering Extraction Mechanism for Recognizing the Actions of Athletes in Sports | |
| CN109062900A (en) | A kind of circle of friends generation method and device | |
| CN114862496A (en) | Session recommendation method, device and medium based on user personalized modeling | |
| Sridhar et al. | Performance Analysis of Two-Stage Iterative Ensemble Method over Random Oversampling Methods on Multiclass Imbalanced Datasets | |
| CN112163073A (en) | Automatic reply dialogue method, system and storage medium |
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 |