CN111324807A - Collaborative filtering recommendation method based on trust degree - Google Patents

Collaborative filtering recommendation method based on trust degree Download PDF

Info

Publication number
CN111324807A
CN111324807A CN202010030767.4A CN202010030767A CN111324807A CN 111324807 A CN111324807 A CN 111324807A CN 202010030767 A CN202010030767 A CN 202010030767A CN 111324807 A CN111324807 A CN 111324807A
Authority
CN
China
Prior art keywords
user
similarity
trust
item
recommendation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010030767.4A
Other languages
Chinese (zh)
Inventor
王凯旋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Original Assignee
Beijing University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN202010030767.4A priority Critical patent/CN111324807A/en
Publication of CN111324807A publication Critical patent/CN111324807A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/067Enterprise or organisation modelling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201Market modelling; Market analysis; Collecting market data

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • Economics (AREA)
  • Accounting & Taxation (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • General Business, Economics & Management (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Educational Administration (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a collaborative filtering recommendation method based on credibility, which is expected to recommend items to the most mental apparatus of users in the large environment of Internet information blowout, thereby saving the precious time of the users and improving the information acquisition efficiency. The algorithm is characterized in that: on the basis of a traditional collaborative filtering algorithm, attribute features (including age factors, occupational factors and gender factors), interestingness (a certain category of items preferred by a user), trust (the satisfaction degree of the user on recommendation of a certain part of users) and other dimensions are fused to model the preference of the user, so that the cold start and sparsity problems of a user scoring matrix are relieved as much as possible, and the most valuable, most desirable and most surprised recommendation is made for the user.

Description

Collaborative filtering recommendation method based on trust degree
Technical Field
The invention relates to computer recommendation, in particular to a computer system applying a recommendation system, collaborative filtering, similarity modeling and trust modeling to all scenes needing recommendation.
Background
The 21 st century is an information explosion era, with the development of computer technology, massive information poses a huge challenge to information search, how to find needed contents in huge information data oceans is achieved, search is more efficient, and a user can have better internet experience
Based on the practical market demands, the recommendation system comes along, which is a method for finding new demands according to the previous behavior information of the user, the personalized recommendation algorithm widely used in each e-commerce at present belongs to a collaborative filtering recommendation algorithm, but the scoring matrix of the user is a sparse matrix, so that: the cold start problem, data sparsity and recommendation accuracy of new users still need continuous research improvement.
Disclosure of Invention
The invention aims to optimize the defects of the existing recommendation algorithm and provides methods for solving the problems of data sparsity and cold start of users and improving the recommendation accuracy.
The contribution points of the invention to similarity are as follows:
attribute features are combined. The attribute features related to the invention comprise age, occupation and gender, and the features identify the living state of the user. The recommendation accuracy can be improved by analyzing the similarity of the attribute features, which also influences the preference of the user.
Combining the interestingness. The interestingness is the core recommendation basis of the recommendation system, and the recommendation accuracy can be greatly improved by a good interestingness model.
In combination with the degree of trust. The trust degree is divided into direct trust degree and indirect trust degree, the direct trust degree can improve the recommendation accuracy, the indirect trust degree can fill a scoring matrix, and the accuracy is improved while the data sparsity is improved.
Table 1 user-rating matrix R (m, n) of m x n based on m users n items
I1 I2 In
U1 R11 R12 R1n
U2 R21 R22 R2n
Um Rm1 Rm2 Rmn
The technical scheme adopted by the invention is a collaborative filtering recommendation method based on the trust degree, and the realization process of the method is as follows:
1) user attribute feature similarity modeling
The user attribute of the user attribute feature similarity model integrates the influence of gender, age and occupation on the interest of the user, and the establishing process is as follows:
a) gender similarity modeling
The interests of different sexes may vary widely, for example, the interests of women who like cosmetics, clothing, jewelryObviously higher than men who are generally more prone to electronic products. Suppose user u has a gender SuGender of user v is SvThen, the gender similarity S (u, v) of the user u and the user v is as follows:
Figure BDA0002364206930000021
b) age similarity modeling
The different ages will be different, so the age model is introduced to optimize the similarity model, let the age of user u be AuAge of user v is AvThe age similarity a (u, v) of user u and user v is as follows:
Figure BDA0002364206930000022
c) occupational similarity modeling
Classifying careers into a tree structure according to categories as shown in the following figure 2, wherein the length of any two nodes in the figure 2 is set as 1, the total length of the parent node nearest to careers a and b is represented by Height, the number of layers in the career tree is called as the Height of the parent node, and H is taken asa,bThe professions of user u and user v are denoted by profession a and profession b, respectively, and the profession similarity O (u, v) is expressed as follows:
Figure BDA0002364206930000031
in conclusion, the attribute similarity sim of the user is obtained by comprehensively considering the gender, the age and the occupational factorsa(u, v) are as follows:
sima(u,v)=αS(u,v)+βA(u,v)+γO(u,v) (4)
α, adjusting the parameters of gamma according to the specific system;
2) modeling the similarity of user interest characteristics;
the attribute characteristics discussed in the upper part provide a recommendation scheme under the condition of cold start, but the user specific interest degree can be modeled after the comment footprints of the user are rich, and the interest is selectedThe influence of selection is extremely important, and the interest level discussed by the method is the interest level of the user in a certain type of items, namely the evaluation proportion of the user to the certain type of items is used as the interest level measurement of the user in the certain type of items. Provided with NIu,iIndicates the total number of evaluations, NI, of user u on the i-class itemuRepresenting the total number of the items evaluated by the user, the interest degree I of the user u in the I-type itemsu,iThe following were used:
Figure BDA0002364206930000032
obtaining the interest degree set I of the user u by using the formula (5)u=(Iu,1,Iu,2,...Iu,i) Is shown in the formula IuvThe number of categories of items that represent user u and user v to score together,
Figure BDA0002364206930000033
the method is used for identifying the average interest degree of the user u to all the item types, and the interest degree sim between the two users is obtained through calculation according to the Pearson correlation similarityI(u, v) are as follows:
Figure BDA0002364206930000041
3) similarity calculation:
the calculation of user similarity relies on a user-item scoring table, with each user interest represented by a scoring vector to map to each row in table 1, so the calculation of user similarity essentially calculates the distance between the user scoring vectors. The calculation methods of the user similarity are numerous, and the constrained Pearson correlation similarity and the jaccard similarity are selected for correlation calculation.
And (3) constraining the Pearson correlation similarity: ruvRepresenting a common set of scores for user u and user v, Ru,iIdentifying a rating, R, for item i by user uv,iThe rating of item i by user v is identified,
Figure BDA0002364206930000042
representing all ratings of user uThe average value of the average value is calculated,
Figure 100002_1
identifying the mean of all scores of user v, the score similarity of user u and user v is expressed in terms of pearson's relative similarity as follows:
Figure BDA0002364206930000044
jaccard similarity: the cosine similarity and the constrained pearson correlation similarity measure the similarity based on a common scoring item of the users, and under the condition of sparse data, the two similarity calculation methods have a common problem, namely when the data is sparse until the user u and the user v only have one common scoring item, and both people score the same low score for the item, at the moment, the user u and the user v are not better than the item, but the cosine similarity and the constrained pearson correlation similarity consider that the similarity of the two is the maximum value 1, so that the preference of the two users is preferentially recommended to each other. In order to alleviate the situation, the similarity of the Jarcard is introduced, and the similarity calculation method is measured based on the number of common scores among users, so that the problem can be effectively avoided. The calculation formula is as follows:
Figure BDA0002364206930000045
in the formula | Iu,vI represents the total number of commonly scored items for user u and user v, Iu|,|IvI represents the number of items, Jac, evaluated by user u and user v, respectively(u,v)Has a value range of [0, 1 ]]A larger value indicates a higher correlation between the two.
4) Modeling the user trust:
according to the method, trust factors in social contact are fused into a collaborative filtering recommendation algorithm, and trust is defined as follows: the target user has certain safety, integrity and effectiveness on the recommendation opinions proposed by other users. If the user b accepts the recommendation, the recommendation is not accepted as distrust, and the trust degree of the user b on the user a is the ratio of the accepted number of strokes to n.
4.1) direct confidence calculation
The direct trust degree is that a user actively and directly gives trust scores of other users, but the scheme requires that each user gives trust scores of other users, and the actual operation is difficult, so the method adopts direct trust degree calculation based on a common user score project, and comprises the following steps:
DTrustu,v=|sim(u,v)|×Jac(u,v)(9)
4.2) Indirect confidence computation
The trust relationship between users has the characteristics of subjectivity, weak transitivity, asymmetry and dynamicity. Because the trust degree has transitivity, the problem of sparsity of a scoring matrix is solved, the direct trust degree between two users depends on whether the two users have a common scoring item, and the direct trust degree exists between the users with common scoring, but in life, the direct trust degree often finds that if the user u trusts the user i, and the user i trusts the user v, then the trust relationship of the user u to the user v often exists, which is the transitivity of trust, but in view of the fast attenuation of the trust degree, only the second-order trust degree is taken for improving the accuracy, and the calculation formula is as follows:
Figure BDA0002364206930000051
wherein, PTrustu,vRepresents the indirect trust between the user u and the user v, and adj (u, v) represents the satisfaction of the condition DTrustu,b≥λ,DTrustb,vAnd the lambda parameter is an adjustable credit threshold value, which indicates that only the intermediate users with direct credit larger than lambda can be included in the indirect trust calculation.
The Trust level between user u and user v is denoted Trustu,vThen:
Figure BDA0002364206930000061
5) in summary, the following steps:
integrating user attributes and user interest degrees, score similarity and trust degreez(u, v) is expressed by the following formula: the delta, epsilon, mu and rho can be dynamically adjusted according to different dependence degrees of a specific system on various factors
simz(u,v)=δsim(u,v)+εsimI(u,v)+μsima(u,v)+ρTrustu,v(12)
6) Generating a recommendation result:
according to the comprehensive similarity sim of the user u and the user vz(u,v),
Let user v score item i as Rv,iThe average of the scores of the user v for all the items is
Figure BDA0002364206930000062
Pu,iDenotes the rating, N, of item i by user u based on the rating inference of vuThe top-N sets with the highest scores in all the prediction scores are the final recommended item combination
Figure BDA0002364206930000063
7) Evaluation criteria for the method:
the recommendation quality of the algorithm is evaluated by taking a standard mean error (MAE) as a rating standard, the MAE is a generally accepted evaluation index in the research of the recommendation algorithm, the average absolute deviation of the predicted score of the item by a computing system and the actual score of the item by a user is calculated, the smaller the MAE value is, the higher the recommendation precision of the recommendation system is, and the calculation formula is as follows:
Figure BDA0002364206930000064
wherein: ru,iRepresents the actual rating, P, of user u for item iu,iAnd (4) the predicted scores of the user u on the item i are obtained according to the method.
Drawings
FIG. 1 is a flow chart of the method implementation.
FIG. 2 is a career tree diagram.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and examples.
The collaborative filtering recommendation method based on the trust degree is characterized by comprising the following steps: on the basis of a traditional collaborative filtering algorithm, multiple dimensions such as attribute characteristics, interestingness, trust and the like are fused to model the hobbies of the user, the problems of cold start and sparsity of a user scoring matrix are relieved as much as possible, and the most valuable, most desirable and most surprised recommendation is made for the user.
Based on the traditional collaborative filtering recommendation algorithm, the attribute similarity of the user is fused, and the attributes of age, occupation and gender which possibly influence the user choice are fused into the recommendation process of the algorithm
On the basis of the traditional collaborative filtering algorithm, the similarity of the user attribute characteristics is combined, the preference of a user for a certain type of items is fully considered into the algorithm,
on the basis of the traditional collaborative filtering algorithm, the modeling of the user trust adopts the calculation of two dimensions of the direct trust and the indirect trust, so that the problem of the sparsity of a user scoring matrix is solved
And finally, the calculation mode of the similarity can dynamically adjust the proportion parameters of different influence factors according to different scenes, so as to obtain the project which best meets the requirements of the user to the maximum extent.

Claims (1)

1. The collaborative filtering recommendation method based on the trust degree is characterized by comprising the following steps: the method comprises the following implementation processes:
1) user attribute feature similarity modeling
The user attribute of the user attribute feature similarity model integrates the influence of gender, age and occupation on the interest of the user, and the establishing process is as follows:
a) gender similarity modeling
Suppose user u has a gender SuGender of user v is SvThen, the gender similarity S (u, v) of user u and user v) As follows:
Figure FDA0002364206920000011
b) age similarity modeling
Let the age of user u be AuAge of user v is AvThe age similarity a (u, v) of user u and user v is as follows:
Figure FDA0002364206920000012
c) occupational similarity modeling
Classifying careers into a tree structure according to categories, setting the length of any two nodes to be 1, expressing the total length of the layer number of the nearest parent node of career a and career b in the career tree by Height to be called the Height thereof, and recording Ha,bThe professions of user u and user v are denoted by profession a and profession b, respectively, and the profession similarity O (u, v) is expressed as follows:
Figure FDA0002364206920000013
in conclusion, the attribute similarity sim of the user is obtained by comprehensively considering the gender, the age and the occupational factorsa(u, v) are as follows:
sima(u,v)=αS(u,v)+βA(u,v)+γO(u,v) (4)
α, adjusting the parameters of gamma according to the specific system;
2) modeling the similarity of user interest characteristics;
provided with NIu,iIndicates the total number of evaluations, NI, of user u on the i-class itemuRepresenting the total number of the items evaluated by the user, the interest degree I of the user u in the I-type itemsu,iThe following were used:
Figure FDA0002364206920000021
obtaining the interest degree set I of the user u by using the formula (5)u=(Iu,1,Iu,2,...Iu,i) Is shown in the formula IuvThe number of categories of items that represent user u and user v to score together,
Figure FDA0002364206920000026
the method is used for identifying the average interest degree of the user u to all the item types, and the interest degree sim between the two users is obtained through calculation according to the Pearson correlation similarityI(u, v) are as follows:
Figure FDA0002364206920000022
3) similarity calculation:
the calculation of the user similarity relies on the user-item score table, each user interest is represented by a score vector to map with each row in table 1, so the calculation of the user similarity essentially calculates the distance between the user score vectors; the method for calculating the user similarity is numerous, and restricted Pearson correlation similarity and jaccard similarity are selected for correlation calculation;
and (3) constraining the Pearson correlation similarity: ruvRepresenting a common set of scores for user u and user v, Ru,iIdentifying a rating, R, for item i by user uv,iThe rating of item i by user v is identified,
Figure FDA0002364206920000023
represents the mean of all the scores of the user u,
Figure 1
identifying the mean of all scores of user v, the score similarity of user u and user v is expressed in terms of pearson's relative similarity as follows:
Figure FDA0002364206920000025
jaccard similarity: the calculation formula is as follows:
Figure FDA0002364206920000031
in the formula Iu,vI represents the total number of commonly scored items for user u and user v, Iu|,|IvI represents the number of items, Jac, evaluated by user u and user v, respectively(u,v)Has a value range of [0, 1 ]]A larger value indicates a higher correlation between the two;
4) modeling the user trust:
fusing trust factors in social contact into a collaborative filtering recommendation algorithm, wherein if the user a receives a recommendation, the recommendation is not accepted as untrustworthy, and the trust degree of the user b on the user a is the ratio of the accepted number of strokes to n, and all recommended items n made by the user a on the user b are recommended;
4.1) direct confidence calculation
The direct trust degree is that a user actively and directly gives trust scores of other users, but the scheme requires that each user gives trust scores of other users, and the actual operation is difficult, so the method adopts direct trust degree calculation based on a common user score project, and comprises the following steps:
DTrustu,v=|sim(u,v)|×Jac(u,v)(9)
4.2) Indirect confidence computation
The direct trust between two users depends on whether the two users have a common scoring item, the direct trust exists between the users with common scoring, if the user u trusts the user i, and the user i trusts the user v, the user u often has a trust relationship to the user v, which is the transitivity of trust, and only the second-order trust is taken, and the calculation formula is as follows:
Figure FDA0002364206920000032
DTrustu,b≥λ,DTrustb,v≥λ (10)
wherein, PTrustu,vRepresents the indirect trust between the user u and the user v, and adj (u, v) represents the satisfaction of the condition DTrustu,b≥λ,DTrustb,vIn ≧ λThe lambda parameter is an adjustable credit threshold value, which indicates that only the intermediate users with direct credit larger than lambda can be brought into indirect trust calculation;
the Trust level between user u and user v is denoted Trustu,vThen:
Figure FDA0002364206920000041
5) in summary, the following steps:
integrating user attributes and user interest degrees, score similarity and trust degreez(u, v) is expressed by the following formula: the delta, epsilon, mu and rho can be dynamically adjusted according to different dependence degrees of a specific system on various factors
simz(u,v)=δsim(u,v)+εsimI(u,v)+μsima(u,v)+ρTrustu,v(12)
6) Generating a recommendation result:
according to the comprehensive similarity sim of the user u and the user vz(u, v) let user v score item i be Rv,iThe average of the scores of the user v for all the items is
Figure FDA0002364206920000042
Pu,iDenotes the rating, N, of item i by user u based on the rating inference of vuThe top-N sets with the highest scores in all the prediction scores are the final recommended item combination
Figure FDA0002364206920000043
7) Evaluation criteria for the method:
the recommendation quality of the algorithm is evaluated by taking the standard average error MAE as a rating standard, the average absolute deviation of the prediction score of the computing system to the item and the actual score of the user to the item is calculated, the smaller the MAE value is, the higher the recommendation precision of the recommendation system is, and the calculation formula is as follows:
Figure FDA0002364206920000044
wherein: ru,iRepresents the actual rating, P, of user u for item iu,iAnd (4) the predicted scores of the user u on the item i are obtained according to the method.
CN202010030767.4A 2020-01-13 2020-01-13 Collaborative filtering recommendation method based on trust degree Pending CN111324807A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010030767.4A CN111324807A (en) 2020-01-13 2020-01-13 Collaborative filtering recommendation method based on trust degree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010030767.4A CN111324807A (en) 2020-01-13 2020-01-13 Collaborative filtering recommendation method based on trust degree

Publications (1)

Publication Number Publication Date
CN111324807A true CN111324807A (en) 2020-06-23

Family

ID=71168719

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010030767.4A Pending CN111324807A (en) 2020-01-13 2020-01-13 Collaborative filtering recommendation method based on trust degree

Country Status (1)

Country Link
CN (1) CN111324807A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111523054A (en) * 2020-04-26 2020-08-11 山东师范大学 Project recommendation method and system based on active account and similar accounts
CN112364243A (en) * 2020-11-11 2021-02-12 吉林师范大学 Big data-based information recommendation system
CN112883289A (en) * 2021-04-16 2021-06-01 河北工程大学 PMF recommendation method based on social trust and tag semantic similarity
CN113407863A (en) * 2021-06-17 2021-09-17 天津大学 Personalized product service scheme recommendation method based on trust and forgetting function
CN114647773A (en) * 2020-12-17 2022-06-21 赣南师范大学 Improved collaborative filtering method based on multiple linear regression and third-party credit

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105528419A (en) * 2015-11-30 2016-04-27 合肥工业大学 Personalized search method based on modeling considering user-author relation
CN109815402A (en) * 2019-01-23 2019-05-28 北京工业大学 Collaborative Filtering Recommendation Algorithm based on user characteristics
CN109978709A (en) * 2019-04-08 2019-07-05 燕山大学 A kind of trust network construction method based on node interbehavior
US10475105B1 (en) * 2018-07-13 2019-11-12 Capital One Services, Llc Systems and methods for providing improved recommendations

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105528419A (en) * 2015-11-30 2016-04-27 合肥工业大学 Personalized search method based on modeling considering user-author relation
US10475105B1 (en) * 2018-07-13 2019-11-12 Capital One Services, Llc Systems and methods for providing improved recommendations
CN109815402A (en) * 2019-01-23 2019-05-28 北京工业大学 Collaborative Filtering Recommendation Algorithm based on user characteristics
CN109978709A (en) * 2019-04-08 2019-07-05 燕山大学 A kind of trust network construction method based on node interbehavior

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
蒋宗礼: "基于用户特征的协同过滤推荐算法", 《计算机系统应用》 *
蒋宗礼: "融合用户相似度与信任度的协同过滤推荐算法", 《软件导刊》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111523054A (en) * 2020-04-26 2020-08-11 山东师范大学 Project recommendation method and system based on active account and similar accounts
CN112364243A (en) * 2020-11-11 2021-02-12 吉林师范大学 Big data-based information recommendation system
CN114647773A (en) * 2020-12-17 2022-06-21 赣南师范大学 Improved collaborative filtering method based on multiple linear regression and third-party credit
CN114647773B (en) * 2020-12-17 2024-03-22 赣南师范大学 Improved collaborative filtering method based on multiple linear regression and third party credit
CN112883289A (en) * 2021-04-16 2021-06-01 河北工程大学 PMF recommendation method based on social trust and tag semantic similarity
CN112883289B (en) * 2021-04-16 2022-05-06 河北工程大学 PMF recommendation method based on social trust and tag semantic similarity
CN113407863A (en) * 2021-06-17 2021-09-17 天津大学 Personalized product service scheme recommendation method based on trust and forgetting function

Similar Documents

Publication Publication Date Title
CN111324807A (en) Collaborative filtering recommendation method based on trust degree
CN104935963B (en) A kind of video recommendation method based on timing driving
CN109241405B (en) Learning resource collaborative filtering recommendation method and system based on knowledge association
CN111797321B (en) Personalized knowledge recommendation method and system for different scenes
CN103533390B (en) The method and system of television program recommendations are carried out based on social network information
CN106682114A (en) Personalized recommending method fused with user trust relationships and comment information
CN109241203B (en) Clustering method for user preference and distance weighting by fusing time factors
CN109947987B (en) Cross collaborative filtering recommendation method
CN109471982B (en) Web service recommendation method based on QoS (quality of service) perception of user and service clustering
CN104462383A (en) Movie recommendation method based on feedback of users' various behaviors
CN107944035A (en) A kind of image recommendation method for merging visual signature and user's scoring
CN111639258B (en) News recommendation method based on neural network
CN104851025A (en) Case-reasoning-based personalized recommendation method for E-commerce website commodity
CN107391670A (en) A kind of mixing recommendation method for merging collaborative filtering and user property filtering
CN111681084A (en) E-commerce platform recommendation method based on social relationship influence factors
Li et al. Collaborative filtering based on user attributes and user ratings for restaurant recommendation
CN116244513A (en) Random group POI recommendation method, system, equipment and storage medium
CN104572915B (en) One kind is based on the enhanced customer incident relatedness computation method of content environment
Cao et al. A Recommendation Approach Based on Product Attribute Reviews: Improved Collaborative Filtering Considering the Sentiment Polarity.
CN110059257B (en) Project recommendation method based on score correction
CN112836137B (en) Character network support degree computing system and method, terminal, equipment and storage medium
CN108269172B (en) Collaborative filtering method based on comprehensive similarity migration
CN111198991A (en) Collaborative filtering recommendation method based on trust level and expert user
CN109670914B (en) Product recommendation method based on time dynamic characteristics
CN110825965A (en) Improved collaborative filtering recommendation method based on trust mechanism and time weighting

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200623