Method for solving social recommendation problem by low-rank semi-definite programming
A semi-definite programming and problem technology, applied in the field of using semi-definite programming to solve social recommendation problems, can solve problems such as complex algorithms and low accuracy, and achieve the effect of improving accuracy and increasing application value.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0022] figure 1 It is a flow chart of a preferred embodiment of a method for solving a social recommendation problem using a low-rank semidefinite programming of the present invention. The detailed implementation steps are as follows:
[0023] 1. In a recommender system with m users and n items, we extract the user's rating matrix M ∈ R m*n , then use Normalize the scores in M to (0-1) to obtain a new user scoring matrix M′, where, are all rating values [1,2…,r max ] mean;
[0024] 2. First, use the user scoring matrix M' to obtain the objective function of minimizing the difference
[0025] min U , V = | | I ⊗ ( M ′ - ρ ( U ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com