Personalized object recommending method based on object similarity and network structure
A technology of network structure and recommendation method, applied in the Internet field, can solve the problems of loss of effective information, affecting the accuracy of recommendation results, waste, etc., and achieve the effect of improving accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0028] Example 1, personalized item recommendation based on item category information similarity and network structure
[0029] Step 1: Construct an n×m proximity matrix A;
[0030] 1a) Define that the recommendation system has n items and m users. The items refer to recommended items such as movies, books and music. Taking movies as an example, if there are 1682 movies and 943 users in a movie recommendation system, then Take 1682 for n and 943 for m;
[0031] 1b) Define a two-part network graph structure as G(X,Y,E), where item node X is represented as x 1 ,x 2 ,...,x j ,...x n , the user node Y is denoted as y 1 ,y 2 ,...,y l ,...y m , E represents the edge of the two-part network graph structure, if user y l Items browsed or purchased x j , then connect the two nodes, where j is an integer from 1 to n, and l is an integer from 1 to n;
[0032] 1c) According to the above two-part network structure, an n×m proximity matrix is obtained
[0033] The value of ro...
Embodiment 2
[0049] Example 2, personalized item recommendation based on item rating information similarity and network structure
[0050] Step 1: Construct an n×m proximity matrix A;
[0051] (1a) Define that the recommendation system has n items and m users. Items refer to recommended items such as movies, books and music. Taking movies as an example, if there are 1682 movies and 943 users in a movie recommendation system, then n is 1682 , m takes 943;
[0052] (1b) Define the two-part network graph structure as G(X,Y,E), where the item node X is represented as x 1 ,x 2 ,...,x j ,...x n , the user node Y is denoted as y 1 ,y 2 ,...,y l ,...y m , E represents the edge of the two-part network graph structure, if user y l Items browsed or purchased x j , then connect the two nodes, where j is an integer from 1 to n, and l is an integer from 1 to n;
[0053] (1c) According to the above two-part network structure, an n×m proximity matrix is obtained
[0054] The value of row j...
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