A Method for Click Conversion Prediction in Sparse Feature Scenarios
A sparse feature and scene technology, applied in neural learning methods, marketing, data processing applications, etc., can solve problems such as modeling difficulties, achieve the effects of alleviating gradient problems, improving accuracy, and easy optimization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0043] The method for click conversion prediction in the sparse feature scenario includes the following steps:
[0044] S1: establish a CTR model, the CTR model includes a first level, a second level, a third level and a fourth level;
[0045] S2: Collect user sparse behavior features, input the user sparse behavior features into the CTR model in step S1, and perform matrixing to obtain a user sparse feature matrix;
[0046] S3: Input the user sparse feature matrix, and convert the user sparse feature matrix into a dense embedding matrix through the first level of the CTR model;
[0047] S4: Input the dense embedding matrix into the second level, learn the low-order interactive features, and obtain the interactive feature relationship between the low-order features;
[0048] S5: take the output in step S4 as the input of the third level, learn high-order interactive features, and obtain the interactive feature relationship between the high-order features;
[0049] S6: Use th...
Embodiment 2
[0052] like figure 1 As shown, the method for click conversion prediction in the sparse feature scenario includes the following steps:
[0053] S1: establish a CTR model, the CTR model includes a first level, a second level, a third level and a fourth level;
[0054] S2: Collect user sparse behavior features, input the user sparse behavior features into the CTR model in step S1, and perform matrixing to obtain a user sparse feature matrix;
[0055] S3: Input the user sparse feature matrix, and convert the user sparse feature matrix into a dense embedding matrix through the first level of the CTR model;
[0056] S4: Input the dense embedding matrix into the second-level factorization layer and the second-order interaction layer respectively, where the factorization layer is used to learn the interactive feature information between low-level and linearly related features, and the second-order interaction layer is used to learn Interaction feature information between features o...
Embodiment 3
[0061] This embodiment is a supplementary description of Embodiment 2.
[0062] like figure 1 As shown, the factorization layer adopts the FM model to learn the interactive feature information between low-order and linearly related features.
[0063] The FM model has the following advantages: first, the FM model can still make reliable predictions even when the data is very sparse; second, the FM model has linear time complexity and can be solved directly using the original problem; in addition, FM The model is a general model, and the feature value of its training data can be any real number, while other advanced decomposition models have strict restrictions on the input data.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



