Collaborative filtering method on basis of scene implicit relation among articles

An implicit relationship, collaborative filtering technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as high computational complexity, poor scalability, and difficulty in obtaining accuracy.

Inactive Publication Date: 2012-11-21
ZHEJIANG UNIV
View PDF4 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The above context-aware recommendation algorithm has the following deficiencies: (1) Data sparsity problem: With the introduction of context information, the three-dimensional user-item-scenario scoring matrix is ​​more sparse than the traditional user-item scoring matrix, and context-related pre-filtering and The recommended method of post-filtering is difficult to achieve the desired accuracy
(2) Scalability issues
Although the context-related modeling method is more suitable for sparse data than the context-related pre-filtering method and post-filtering method, the existing scene-related modeling methods often have high computational complexity and poor scalability.

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
  • Collaborative filtering method on basis of scene implicit relation among articles
  • Collaborative filtering method on basis of scene implicit relation among articles
  • Collaborative filtering method on basis of scene implicit relation among articles

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] 1) Establishment of the movie-time rating matrix: from the original user-movie-time rating data, the ratings obtained by each movie at different times are obtained by means of weighted average, so as to establish the movie-time rating matrix. First, calculate the user's activity level at different times: D ik =N ik / N i , where D ik Indicates the activity level of user i at time k, N ik Indicates the number of ratings of user i at time k, N i Indicates the total number of ratings of user i; from the user-movie-time three-dimensional rating matrix Extract movie-time matrix from Here the matrix R ic In the jth row, the element r of the kth column jk denotes the rating of movie j at time k, and has in Denotes the rating of movie j by user i at time k.

[0041] 2) Movie implicit feature extraction: The movie-time rating matrix is ​​decomposed by matrix decomposition method, and the hidden factor matrix of the movie is obtained: where I n×f That is, the late...

Embodiment 2

[0045] 1) Establishment of the restaurant-location scoring matrix: From the original user-restaurant-location scoring data, the scores obtained by each restaurant in different locations are obtained by weighted average, so as to establish the restaurant-location scoring matrix. First, calculate how active the user is in different locations: D ik =N ik / N i , where D ik Indicates the activity level of user i at location k, N ik Indicates the number of ratings of user i under location k, N i Indicates the total number of ratings of user i; from the user-restaurant-location three-dimensional rating matrix Extract restaurant-location matrix from Here the matrix R ic In the jth row, the element r of the kth column jk represents the rating of restaurant j relative to location k, and has in Indicates user i's rating on restaurant j at location k; in general, the closer to the restaurant, the higher the corresponding rating.

[0046] 2) Restaurant implicit feature extrac...

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 collaborative filtering method on the basis of a scene implicit relation among articles. The collaborative filtering method comprises the following steps of: 1, extracting scores of the articles in different scenes from original score data and establishing an article-scene score matrix; 2, decomposing the article-scene score matrix by a matrix decomposition method to obtain an implicit factor matrix of the articles; 3, establishing a scene feature vector for each article by using the obtained implicit factor matrix of the articles so as to calculate the similarity among the articles by utilizing a Pearson correlation coefficient and establish an article implicit relation matrix; and 4, integrating obtained article implicit relation information into a probability matrix decomposition matrix to generate a personalized recommendation. According to the invention, scene information can be sufficiently utilized to mine the implicit relation information among the articles, and the recommendation is generated by utilizing the implicit relation among the articles; the collaborative filtering method has high expandability for the scene information, and a candidate scene set can be regulated according to the application requirements; and the accuracy and the personalization degree of the recommendation can be effectively improved.

Description

technical field [0001] The invention relates to a collaborative filtering method, in particular to a collaborative filtering method based on contextualized implicit relationships among items. Background technique [0002] In recent years, with the increasingly serious problem of Internet information overload, the provision of many services urgently needs the support of personalized recommendation systems. However, traditional recommendation techniques only consider two entities, namely "user" and "item", while ignoring the impact of contextual information (such as time, location, person, activity status, device status, network condition, etc.) on recommendation. For this reason, context-aware recommendation systems have gradually attracted attention. Practice has proved that the introduction of context information can effectively improve the accuracy and personalization of recommendations. [0003] At present, context-aware recommendation algorithms are mainly divided into ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 徐从富刘强王铖微
Owner ZHEJIANG UNIV
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