Bipartite graph recommendation method based on differentiated resource allocation
A technology for resource allocation and recommendation methods, applied in special data processing applications, instruments, electrical digital data processing, etc., and can solve problems such as unreasonable initial resource settings
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0054] The technical solutions in the embodiments of the present invention will be described clearly and in detail below with reference to the drawings in the embodiments of the present invention. The described embodiments are only some of the embodiments of the invention.
[0055] The technical scheme that the present invention solves the problems of the technologies described above is:
[0056] In this embodiment, a recommendation method based on the joint community of users and ratings is performed as follows.
[0057] Step 1: Model the recommender system as a bipartite graph
[0058] The recommendation system is modeled as a bipartite graph, in which the two sets of nodes represent the user set U and the item set O respectively, and when the user selects an item, they are connected, that is, the two form an edge. One consists of n users U={u 1 ,u 2 … u n} and m items O = {o 1 ,o 2 ,...,o m} The bipartite graph composed of adjacency matrix A={a αi} n,m means that ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


