Matrix decomposition recommendation method in graph construction framework

A technology of matrix decomposition and recommendation method, applied in the field of recommendation learning, to achieve the effect of improving recommendation accuracy, fast convergence, and improving performance

Inactive Publication Date: 2017-06-13
NANJING NORMAL UNIVERSITY
View PDF0 Cites 22 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] Purpose of the invention: The present invention aims at the problems existing in the prior art, and provides a new matrix decomposition recommendation method that combines manifold regularization and neighbor similarity improveme

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Matrix decomposition recommendation method in graph construction framework
  • Matrix decomposition recommendation method in graph construction framework
  • Matrix decomposition recommendation method in graph construction framework

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] Such as figure 1 As shown, this embodiment discloses a matrix decomposition recommendation method under the graph construction framework, including the following steps:

[0037] Step 1: Create a rating matrix based on user rating data. The scoring matrix R is specifically described in Table 1.

[0038] Step 2: Add constraint items to the score matrix decomposition model based on manifold regularization to update the similarity information, so as to establish a new decomposition model as:

[0039]

[0040] In the formula, m represents the number of users, and n represents the number of items. If user u has rated item i, then I ui Denoted as 1, if user u does not rate item i, then I ui represented as 0, r ui Represents the rating value of user u on item i, μ represents the global average of all recorded ratings, b u Denotes the user bias vector of user u, b i Denotes the item bias vector of item i, p u ,q i is the latent semantic feature vector, p u Represents...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a matrix decomposition recommendation method in a graph construction framework. The method comprises the following steps of (1) establishing a score matrix according to user score data; (2) adding constraint terms to a manifold regularization-based score matrix decomposition model to update similarity information so as to build a new decomposition model; (3) calculating initial similarity between articles based on a score, tag or topic model; (4) randomly initializing to-be-solved latent semantic eigenvectors in the decomposition model and offset vectors of the articles and a user; (5) based on the initial similarity, adaptively updating parameters in the decomposition model by using a stochastic gradient descent method; and (6) obtaining a complete final score matrix, and providing recommendation for the user according to the score matrix. According to the method, the deficiency of a recommendation algorithm depending on similarity in inaccurate similarity calculation can be made up for.

Description

technical field [0001] The invention relates to the field of recommendation learning, in particular to a matrix decomposition recommendation method under a graph construction framework. Background technique [0002] At present, existing recommendation technologies include content-based recommendation, collaborative filtering recommendation, and so on. The content-based recommendation algorithm constructs user preference information based on some historical information of users, calculates the similarity between recommended items and user preferences, and recommends items with high similarity to users. Collaborative filtering algorithms can be divided into neighborhood-based collaborative filtering algorithms and matrix factorization algorithms. Collaborative filtering recommendation algorithms based on neighbors include user-based collaborative filtering recommendation algorithms and item-based collaborative filtering algorithms. Matrix decomposition is to complete the sco...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q30/06G06K9/62
CPCG06Q30/0631G06F18/22
Inventor 杨明陶昀翔
Owner NANJING NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products