CN103632290B - A kind of based on the mixing recommendation method recommending probability fusion - Google Patents

A kind of based on the mixing recommendation method recommending probability fusion Download PDF

Info

Publication number
CN103632290B
CN103632290B CN201310637512.4A CN201310637512A CN103632290B CN 103632290 B CN103632290 B CN 103632290B CN 201310637512 A CN201310637512 A CN 201310637512A CN 103632290 B CN103632290 B CN 103632290B
Authority
CN
China
Prior art keywords
user
commodity
scoring
item
marking
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.)
Active
Application number
CN201310637512.4A
Other languages
Chinese (zh)
Other versions
CN103632290A (en
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.)
Hefei University of Technology
Original Assignee
Hefei 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 Hefei University of Technology filed Critical Hefei University of Technology
Priority to CN201310637512.4A priority Critical patent/CN103632290B/en
Publication of CN103632290A publication Critical patent/CN103632290A/en
Application granted granted Critical
Publication of CN103632290B publication Critical patent/CN103632290B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses and a kind of recommend method based on the mixing recommending probability fusion, the method comprises the steps: 1) score data of commodity is represented with bivariate table;2) to the Arbitrary Term marked in set as unknown number, utilize basis recommendation method to obtain predicting the outcome of respective items, utilize neutral net to be trained obtaining score in predicting model SFM the set predicted the outcome of mark item rating and respective items;3) utilize basis recommendation method item of not marked to predict the outcome, the set that item of not marking predicts the outcome utilizes SFM obtain the final predictive value of item of not marking;4) according to the size of each predictive value in item of not marking final predictive value set, all items of not marking of user being carried out descending and obtain an ordered set of not marking, the front N item choosing an ordered set of not marking recommends user as recommendation results.The present invention can effectively reflect the truth that user evaluates, and improves the precision of personalized recommendation.

Description

A kind of based on the mixing recommendation method recommending probability fusion
Technical field
The invention belongs to e-commerce field, specifically a kind of based on the mixing recommendation method recommending probability fusion.
Background technology
Along with the fast development of ecommerce, information overload phenomenon is further serious.How to meet the individual demand of user based on the commodity set of magnanimity and become the major issue promoting Consumer's Experience, improving user satisfaction.Personalized recommendation system is the important means meeting users ' individualized requirement.Personalized recommendation system is according to the individual online browse data of user or buys data construct user interest preference model, thus recommend to meet the commodity of its unique need to user.Individual commodity recommendation is widely applied at e-commerce websites such as Amazon, store, Jingdone district, Taobaos, is effectively increased the probability that user buys, improves user's experience to website service.
Collaborative filtering (CollaborativeFiltering) technology is personalized recommendation application the earliest and the most successfully one of technology, and its main thought is based on its interest preference of user also this hypothesis identical with similar features and builds user interest preference model.Although the structure that existing research method can be personalized recommendation system is provided fundamental basis and practical advice, but yet suffers from many defects:
(1) what recommendation information represented is imperfect.Evaluating of commodity is generally represented or is predicted as a concrete numerical value by existing recommendation method by user, such as prediction user being evaluated as 3 points and namely think that the probability that commodity scoring is 3 points is 100% by user commodity.It practice, the evaluation of particular commodity is generally in a kind of uncertain state by user, as the evaluation of a certain commodity being generally " well ", " all right ", " pretty good ".The nondeterministic statement of commodity evaluation is expressed as by user user and provides the probability of different scoring for commodity, such as commodity are evaluated as the probability of 3 points, 4 points, 5 points respectively 30%, 40% and 20%, can effectively reflect the truth that user evaluates, the precision improving personalized recommendation is had active influence.User's grade form is shown as a concrete numerical value and have ignored the uncertainty that user evaluates by existing method, it is impossible to reflection user evaluates the truth of commodity, reduces the precision of commending system.
(2) the fusion problem of recommendation information.Collaborative filtering method based on user recommends, by calculating neighbor user, the article that the user that those and he have common interest to like likes, it is recommended that result focuses on the focus reflecting the small group similar with user interest;Project-based collaborative filtering method recommends, to user, the commodity that those are similar with the commodity that he selected in the past by calculating commodity neighbours, it is recommended that result focuses on the historical interest maintaining user.Produce personalized recommendation result from user and item perspective respectively based on the collaborative filtering of user, project-based collaborative filtering method, carry out the above results merging and the recommendation information of various angles can be comprehensively utilized, improve the precision of personalized recommendation.Existing research lacks the Unified frame that different angles recommendation information is merged.Such as, a kind of Collaborative Filtering Recommendation Algorithm based on Collaborative Filtering utilizes the input as the collaborative filtering method based on user that predicts the outcome that project-based collaborative filtering method obtains, although fully utilizing the collaborative filtering method based on user and project-based collaborative filtering method, but collaborative filtering result and the project-based collaborative filtering result based on user is not merged by it.
Summary of the invention
The present invention is the weak point overcoming prior art to exist, propose a kind of based on the mixing recommendation method recommending probability fusion, it is not only the recommendation results merging different recommendation method generation and provides unified framework, and can effectively reflect the truth that user evaluates, improve the precision of personalized recommendation.
In order to achieve the above object, the technical solution adopted in the present invention is:
A kind of feature based on the mixing recommendation method recommending probability fusion of the present invention is to carry out as follows:
Step one, bivariate table T={U, I, f} is used to represent the score data of commodity;
In described bivariate table T, U={U1,...,Uu,...,U|U|Represent user's set, I={I1,...,Ii,...,I|I|Representing commodity set, f represents user's scoring to commodity;
Described user gathers in U, total number that | U | is user, UuRepresent the u user;In described commodity set I, total number that | I | is commodity, IiRepresent i-th commodity;Assume user UuTo commodity IiGrading system S be { S1,...,Ss,...,S|S|, in described grading system S, mark SsFor integer and S1< ... < Ss< ... < S|S|, S1Represent the minimum scoring of commodity, S|S|Represent the highest scoring of commodity;
In described bivariate table T, by the existing scoring item set of marking of all usersRepresent, For described user UuScoring set, Represent user UuI-th existing scoring item,Represent user UuTotal number of existing scoring item;OrderFor described user UuSet of not marking, Represent user UuI-th do not mark item,Represent user UuTotal number of item of not marking, make described user not mark setIn Arbitrary Term
Step 2, assume that user has marked setIn Arbitrary TermFor unknown number, set that user has been markedIn other utilize and obtain described Arbitrary Term respectively based on collaborative filtering method and the project-based collaborative filtering method of userNeighbor user predict the outcomeWith neighbours' project forecast result;Described neighbor user is predicted the outcomeWith neighbours' project forecast resultAs described Arbitrary TermThe item of scoring predict the outcomeUser is marked setIn the item of scoring of all items predict the outcome and predict the outcome set with item of markingRepresent;
Predict the outcome set by described item of having markedAs the input value of neutral net, set that described user has been markedAs the output valve of described neutral net, described neutral net is trained, it is thus achieved that score in predicting model SFM;
Step 3, set that user has been markedIn all items utilize the described collaborative filtering method based on user and project-based collaborative filtering method to obtain described user not mark setIn Arbitrary TermPreliminary forecasting resultDescribed user is not marked setIn predicting the outcome of all items predict the outcome set with item of not markingRepresent;Predict the outcome set by described item of not markingAs the input value of described score in predicting model SFM, described score in predicting model SFM is utilized to obtain the final predictive value set of item of not marking;
Step 4, by described user UuAll items of not marking carry out descending according to the size of each predictive value in the final predictive value set of described item of not marking and obtain and do not mark an ordered set, the front N item of an ordered set of not marking described in choosing recommends described user U as recommendation resultsu
The present invention lies also in based on the feature of the mixing recommendation method recommending probability fusion:
In described step 2, the collaborative filtering method based on user is to carry out as follows:
1) by described user UuThe user of all commodity is marked setWith other users, the set of scoring of all commodity is utilized respectively constrained Pearson came relatedness metric method and obtains user UuWith user's similarity set of other users, by other users according to the similarity size in described user's similarity set carry out descending obtain preliminary neighbor user set Nu
2) by described commodity IiIn set of markingIn corresponding user be expressed as scoring user and gather Ri
3) by described preliminary neighborhood NuR is gathered with scoring useriFront k the user occured simultaneously is expressed as neighbor user set Nui
4) by described neighbor user set NuiIn each user to commodity IiGrade form be shown as neighbor user scoring set Fui
5) formula (1) is utilized to obtain the scoring probability based on user
Pr ui U ( S s ) = Num U ( S s ) / k - - - ( 1 )
In formula (1), NumU(Ss) gather F for the scoring of described neighbor useruiMiddle scoring SsThe number of times occurred;
6) by described scoring SsWith the described scoring probability based on userConstitute neighbor user to predict the outcome
Pr ui U = { ( S 1 , Pr ui U ( S 1 ) ) , . . . , ( S s , Pr ui U ( S s ) ) , . . . , ( S | S | , Pr ui U ( S | S | ) ) } - - - ( 2 )
In formula (2), Pr ui U ( S s ) &Element; [ 0,1 ] .
Described project-based collaborative filtering method is to carry out as follows:
1) by all users to described commodity IiThe set and the set of scoring of other commodity is utilized respectively constrained Pearson came relatedness metric method obtains described commodity I of markingiWith the commodity similarity set of other commodity, by other commodity according to the similarity size in described commodity similarity set carry out descending obtain preliminary neighbours commodity set Ni
2) by user UuIn set of markingIn corresponding commodity list be shown as scoring commodity set Ru
3) by described preliminary neighbours commodity set NiWith scoring commodity set RuFront k the commodity list occured simultaneously is shown as neighbours commodity set Niu
4) by user UuTo described neighbours commodity set NiuIn the grade form of each commodity be shown as neighbours' commodity scoring set Fiu
5) formula (3) is utilized to obtain project-based scoring probability
Pr ui I ( S s ) = Num I ( S s ) / k - - - ( 3 )
In formula (3), NumI(Ss) gather F for the scoring of described neighbours' commodityiuMiddle scoring SsThe number of times occurred;
6) by described scoring SsWith described project-based scoring probabilityComposition project neighbours predict the outcome
Pr ui I = { ( S 1 , Pr ui I ( S 1 ) ) , . . . , ( S s , Pr ui I ( S s ) ) , . . . , ( S | S | , Pr ui I ( S | S | ) ) } - - - ( 4 )
In formula (4), Pr ui I ( S s ) &Element; [ 0,1 ] .
Compared with the prior art, beneficial effects of the present invention is embodied in:
1, the recommendation results each obtained based on user and project-based recommendation method is expressed as recommending probability by the present invention, neutral net is utilized respective obtained recommendation results to be merged, overcoming conventional hybrid recommends method recommendation information to represent incomplete problem, fusion for different angles recommendation information provides unified framework, and it recommends precision to be substantially better than the recommendation method based on user and project-based recommendation method.
2, the present invention utilizes scoring SsWith scoring two tuple-sets that constitute of probability based on userRepresent the recommendation information that the recommendation method based on user obtains, utilize scoring SsTwo tuple-sets constituted with project-based scoring probabilityRepresenting the recommendation information that project-based recommendation method obtains, compared with the evaluation table of commodity being shown as a concrete numerical value with by user, two tuples that scoring and scoring probability are constituted can reflect the truth that user evaluates more really.
3, the present invention utilizes and predicts the outcome based on the collaborative filtering method of user and project-based collaborative filtering method item of having been marked, item of marking is predicted the outcome set as inputting, using set of marking as exporting, the distinctive capability of fitting of neutral net is utilized to obtain score in predicting model SFM, it is ensured that the robustness of score in predicting model.
4, set of not marking is utilized collaborative filtering method and project-based collaborative filtering method based on user to obtain preliminary forecasting result by the present invention, preliminary forecasting result is not marked the final predictive value set of item as the input of score in predicting model SFM, and then obtain final recommendation results, compared with conventional recommendation method, difference can be recommended the recommendation results of method to carry out effective integration by the present invention, improves the precision of personalized recommendation.
5, the present invention carried mixing recommendation method by based on the collaborative filtering method of user and the result of project-based collaborative filtering method carried out merge be conducive to improve recommendation results multiformity, more conform to the actual preferences of user, overcome the simple shortcoming using the collaborative filtering method based on user or the simple project-based collaborative filtering method of use in prior art.
6, the present invention can be used for the personalized recommendation system of digital product, the travelling routes such as the entity products such as clothing and mobile phone, film and music and the service products such as arrangement of spending a holiday, it is possible to the platform such as webpage and App at computer and mobile phone uses, and has wide range of applications.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the present invention;
Fig. 2 is the sensitivity experiments result of method for measuring similarity;
Fig. 3 is neighbor user (commodity) number sensitivity experiments result;
Fig. 4 is forecasting accuracy experimental result;
Fig. 5 is prediction training pattern sensitivity experiments result.
Detailed description of the invention
The present invention utilizes bivariate table to represent the score data of commodity, to the Arbitrary Term marked in set as unknown number, utilize basis recommendation method to obtain predicting the outcome of respective items, utilize neutral net to be trained obtaining score in predicting model SFM the set predicted the outcome of mark item rating and respective items.Score in predicting model SFM is utilized to obtain the final predictive value of item of not marking the set that the item of not marking obtained by basis recommendation method is predicted the outcome.Finally, standard data set compares with basic algorithm.As it is shown in figure 1, the method for the embodiment of the present invention comprises the following steps:
Step one, use bivariate table T={U, I, f} to represent the score data of commodity, specifically include:
Such as table 1, U={U1,...,Uu,...,U|U|Represent user's set, I={I1,...,Ii,...,I|I|Representing commodity set, f represents user's scoring to commodity;
User gathers in U, total number that | U | is user, UuRepresent the u user;In commodity set I, total number that | I | is commodity, IiRepresent i-th commodity;Assume user UuTo commodity IiGrading system S be { S1,...,Ss,...,S|S|, in grading system S, mark SsFor integer and S1< ... < Ss< ... < S|S|, S1Represent the minimum scoring of commodity, S|S|Represent the highest scoring of commodity;
Table 1
In bivariate table T, by the existing scoring item set of marking of all usersRepresent, For the scoring set of user Uu, Represent user UuI-th existing scoring item,Represent user UuTotal number of existing scoring item;OrderFor user UuSet of not marking, Represent user UuI-th do not mark item,Represent user UuTotal number of item of not marking, make user not mark setIn Arbitrary Term
Step 2, utilize basis recommendation method to obtain predicting the outcome of respective items, will mark item rating and predicting the outcome of respective items utilizes neutral net to be trained obtaining score in predicting model SFM.Concrete steps include:
1) assume that user has marked setIn Arbitrary TermFor unknown number, set that user has been markedIn other utilize based on user collaborative filtering method obtain Arbitrary Term neighbor user predict the outcomeOther refer in set of marking F ^ u = { f ^ u 1 , . . . , f ^ ui , . . . , f ^ u | F ^ u | } In, exceptAll items in addition;
1.1) by user UuTo all commodity I={I1,...,Ii,...,I|I|User marked setWith other users, the set of scoring of all commodity is utilized respectively constrained Pearson came relatedness metric method and obtains user UuWith user's similarity set of other users, by other users according to the similarity size in user's similarity set carry out descending obtain preliminary neighbor user set Nu, other users refer to and gather U={U user1,...,Uu,...,U|U|In except user UuAll users in addition, the set of scoring of all commodity is referred in set of marking by other usersIn except user UuScoring setAll users in addition mark set;The method for measuring similarity of user includes cosine similarity, Pearson came dependency and constrained Pearson came dependency three kinds, devising 5 groups of experiments in order to relatively more different method for measuring similarity the present invention is directed to for the impact of the inventive method precision of prediction, experimental result is as shown in Figure 2.In figure, abscissa represents data set, vertical coordinate represents experiment forecast error, be we can see that by curve in figure, for the standard data set in the present invention, error based on the method for measuring similarity of constrained Pearson came dependency is below cosine similarity metric method and Pearson correlation measure, thus being favorably improved the precision of prediction of the inventive method.
1.2) by commodity IiIn set of markingIn corresponding user be expressed as scoring user and gather Ri
1.3) by preliminary neighbor user set NuR is gathered with scoring useriFront k the user occured simultaneously is expressed as neighbor user set Nui;The selection of k is the key factor affecting the collaborative filtering recommending method effect based on user, and in order to verify the impact on the inventive method precision of prediction of the neighbor user number, the present invention devises 7 groups of experiments, often group is tested and is chosen k neighbor user respectively, k=10, and 20, ..., 80;And calculate precision of prediction.Experimental result as it is shown on figure 3, in figure abscissa represent neighbor user number, vertical coordinate represents experiment forecast error.When neighbor user number k is less, it was predicted that probability is accurate not, reduces the accuracy of prediction;When neighbor user number k is bigger, the similarity between user is not high, also can reduce the accuracy of algorithm predicts.Therefore, for the adopted standard data set of this experiment, neighbor user number can obtain good prediction effect when selecting between [30,70];For other data sets, the determination of best neighbor number of users depends on concrete data cases.
1.4) by neighbor user set NuiIn each user to commodity IiGrade form be shown as neighbor user scoring set Fui
1.5) formula (1) is utilized to obtain the scoring probability based on user, the user U that namely obtains with the collaborative filtering method based on useruTo commodity IiGrading system be SsProbability:
Pr ui U ( S s ) = Num U ( S s ) / k - - - ( 1 )
In formula (1), NumU(Ss) gather F for the scoring of described neighbor useruiMiddle scoring SsThe number of times occurred;
1.6) will mark SsWith the scoring probability based on userConstitute neighbor user to predict the outcome
Pr ui U = { ( S 1 , Pr ui U ( S 1 ) ) , . . . , ( S s , Pr ui U ( S s ) ) , . . . , ( S | S | , Pr ui U ( S | S | ) ) } - - - ( 2 )
In formula (2), Pr ui U ( S s ) &Element; [ 0,1 ] .
2) assume that user has marked setIn Arbitrary TermFor unknown number, set that user has been markedIn other utilize project-based collaborative filtering method obtain Arbitrary Term project neighbours predict the outcome, other refer in set of markingIn, except i-th existing scoring itemAll items in addition;
2.1) user is gathered U to commodity IiThe set and the set of scoring of other commodity is utilized respectively constrained Pearson came relatedness metric method obtains commodity I of markingiWith the commodity similarity set of other commodity, by other commodity according to the similarity size in commodity similarity set carry out descending obtain preliminary commodity neighborhood Ni;Other commodity refer at commodity set I={I1,...,Ii,...,I|I|In except commodity IiAll commodity in addition.
2.2) by user UuIn set of markingIn corresponding commodity list be shown as scoring commodity set Ru
2.3) by preliminary commodity neighborhood NiWith scoring commodity set RuFront k the commodity list occured simultaneously is shown as commodity neighborhood Niu;The selection of k is the key factor affecting project-based collaborative filtering recommending method effect, and in order to verify the impact on the inventive method precision of prediction of neighbours' item number, the present invention devises 7 groups of experiments, often k neighbours' project is chosen in group experiment respectively, k=10, and 20, ..., 80;And calculate precision of prediction.Experimental result as it is shown on figure 3, in figure abscissa represent neighbours' item number, vertical coordinate represents experiment forecast error.When neighbours item number k is less, it was predicted that probability is accurate not, reduces the accuracy of prediction;When neighbours item number k is bigger, the similarity between project is not high, also can reduce the accuracy of algorithm predicts.Therefore, for the adopted standard data set of this experiment, neighbor user number can obtain good prediction effect when selecting between [30,70];For other data sets, the determination of best neighbor number of users depends on concrete data cases.
2.4) by user UuTo commodity neighborhood NiuIn the grade form of each commodity be shown as neighbours' commodity scoring set Fiu
2.5) formula (3) is utilized to obtain project-based scoring probability, the user U that namely obtains with project-based collaborative filtering methoduTo commodity IiGrading system be SsProbability:
Pr ui I ( S s ) = Num I ( S s ) / k - - - ( 3 )
In formula (3), NumI(Ss) gather F for the scoring of neighbours' commodityiuMiddle scoring SsThe number of times occurred;
2.6) will mark SsWith project-based scoring probabilityComposition project neighbours predict the outcome
Pr ui I = { ( S 1 , Pr ui I ( S 1 ) ) , . . . , ( S s , Pr ui I ( S s ) ) , . . . , ( S | S | , Pr ui I ( S | S | ) ) } - - - ( 4 )
In formula (4),
3) neighbor user is predicted the outcomeWith neighbours' project forecast resultAs Arbitrary TermThe item of scoring predict the outcomeSpecifically, the item of scoring of Arbitrary Term predict the outcome into:
f ^ ui 0 = { ( S 1 , Pr ui U ( S 1 ) ) , . . . , ( S s , Pr ui U ( S s ) ) , . . . , ( S | S | , Pr ui U ( S | S | ) ) , ( S 1 , Pr ui I ( S 1 ) ) , . . . , ( S s , Pr ui I ( S s ) ) , . . . , ( S | S | , Pr ui I ( S | S | ) ) }
All items in set of marking are performed step 1) and step 2), by set of markingIn predicting the outcome of all items predict the outcome set with item of markingRepresent;
4) predict the outcome set by item of markingAs the input value of neutral net, by set of markingAs the output valve of neutral net, neutral net is trained, it is thus achieved that score in predicting model SFM.In the present embodiment, the neutral net adopted refers to radial base neural net.Radial base neural net has stronger input and output mapping function, has the characteristic that unique the best is approached and learning process fast convergence rate.
Step 3, set that user has been markedIn all itemsThe collaborative filtering method based on user and project-based collaborative filtering method is utilized to obtain set of not markingIn Arbitrary TermPreliminary forecasting resultTo not mark setIn all itemsPredict the outcome and predict the outcome set with item of not markingRepresent;Item of not marking predicts the outcome setAs the input value of score in predicting model SFM, score in predicting model SFM is utilized to export the final predictive value set of item of not marking;
Step 4, by user UuAll items of not markingCarrying out descending according to the size of each predictive value in item of not marking final predictive value set and obtain an ordered set of not marking, the front N item choosing an ordered set of not marking recommends user U as recommendation resultsu, N represents recommendation number, can according to specifically recommending scene settings.
Carry out experimental demonstration for the inventive method, specifically include:
1) standard data set is prepared
The present invention uses MovieLens data set to verify that probability fusion recommends the effectiveness of method as standard data set, and MovieLens data set is widely used personalized recommendation data set.In MovieLens data set, the film that oneself has been seen by user is marked, and score value is 1 to 5 points, and data set includes 943 isolated users, 1682 films, 100000 scorings.Training set and test set adopt the rule of 80%/20% to split, and namely randomly choose 80000 scorings as training set, and 20000 scorings are as test set.
2) evaluation index
Adopt mean absolute error (MAE) as the evaluation index of the present embodiment.Mean absolute deviation MAE is by calculating the accuracy of the deviation measurement prediction between user's scoring and the final predictive value of respective items actual in test set, and MAE is more little, it is recommended that quality is more high.If actual user marks, set is { p1,...,pl,...,pn, corresponding predictive value set expression is { q1,...,ql,...,qn, then mean absolute error is defined as formula (5):
MAE = &Sigma; l = 1 n | q l - p l | n - - - ( 5 )
3) test on standard data set
In order to verify the effectiveness of institute of the present invention extracting method, herein it is modeled on 5 group data sets of MovieLens data set and predicts, and will predict the outcome and truly mark and compare.As shown in Figure 4, in figure, abscissa represents data set sequence number to experimental result, and vertical coordinate represents experiment forecast error.With the collaborative filtering method based on user and based on compared with the collaborative filtering method of product, the forecast error of the method for the present invention is below the method based on user and project-based method, thus all can obtain more excellent predictablity rate on each data set.
For verifying the robustness of institute of the present invention extracting method, herein by the hidden layer neuron quantity and the hidden layer learning function that change radial base neural net, separately design 7 groups of experiments and be verified.Experimental result as it is shown in figure 5, in figure abscissa represent experiment sequence number, vertical coordinate represents experiment forecast error.As seen from Figure 5, changing hidden layer neuron quantity and the hidden layer learning function of radial base neural net, the forecast error of the inventive method there will be certain change;But, under rational hidden layer neuron quantity and hidden layer learning function are arranged, the forecast error of context of methods is consistently lower than the method based on user and project-based method, thus the present invention is better than the collaborative filtering method based on user and the collaborative filtering recommending method based on product.

Claims (1)

1. recommend a method based on the mixing recommending probability fusion, it is characterized in that carrying out as follows:
Step one, bivariate table T={U, I, f} is used to represent the score data of commodity;
In described bivariate table T, U={U1,...,Uu,...,U|U|Represent user's set, I={I1,...,Ii,...,I|I|Representing commodity set, f represents user's scoring to commodity;
Described user gathers in U, total number that | U | is user, UuRepresent the u user;In described commodity set I, total number that | I | is commodity, IiRepresent i-th commodity;Assume user UuTo commodity IiGrading system S be { S1,...,Ss,...,S|S|, in described grading system S, mark SsFor integer and S1< ... < Ss< ... < S|S|, S1Represent the minimum scoring of commodity, S|S|Represent the highest scoring of commodity;
In described bivariate table T, by the existing scoring item set of marking of all usersRepresent, For described user UuScoring set, Represent user UuI-th existing scoring item,Represent user UuTotal number of existing scoring item;OrderFor described user UuSet of not marking, Represent user UuI-th do not mark item,Represent user UuTotal number of item of not marking, make described user not mark setIn Arbitrary Term
Step 2, assume that user has marked setIn Arbitrary TermFor unknown number, set that user has been markedIn other utilize and obtain described Arbitrary Term respectively based on collaborative filtering method and the project-based collaborative filtering method of userNeighbor user predict the outcomeWith neighbours' project forecast resultDescribed neighbor user is predicted the outcomeWith neighbours' project forecast resultAs described Arbitrary TermThe item of scoring predict the outcomeUser is marked setIn the item of scoring of all items predict the outcome and predict the outcome set with item of markingRepresent;
Predict the outcome set by described item of having markedAs the input value of neutral net, set that described user has been markedAs the output valve of described neutral net, described neutral net is trained, it is thus achieved that score in predicting model SFM;
Step 3, set that user has been markedIn all items utilize the described collaborative filtering method based on user and project-based collaborative filtering method to obtain described user not mark setIn Arbitrary TermPreliminary forecasting resultDescribed user is not marked setIn predicting the outcome of all items predict the outcome set with item of not markingRepresent;Predict the outcome set by described item of not markingAs the input value of described score in predicting model SFM, described score in predicting model SFM is utilized to obtain the final predictive value set of item of not marking;
Step 4, by described user UuAll items of not marking carry out descending according to the size of each predictive value in the final predictive value set of described item of not marking and obtain and do not mark an ordered set, the front N item of an ordered set of not marking described in choosing recommends described user U as recommendation resultsu
In described step 2, the collaborative filtering method based on user is to carry out as follows:
1) by described user UuThe user of all commodity is marked setWith other users, the set of scoring of all commodity is utilized respectively constrained Pearson came relatedness metric method and obtains user UuWith user's similarity set of other users, by other users according to the similarity size in described user's similarity set carry out descending obtain preliminary neighbor user set Nu
2) by described commodity IiIn set of markingIn corresponding user be expressed as scoring user and gather Ri
3) by described preliminary neighborhood NuR is gathered with scoring useriFront k the user occured simultaneously is expressed as neighbor user set Nui
4) by described neighbor user set NuiIn each user to commodity IiGrade form be shown as neighbor user scoring set Fui
5) formula (1) is utilized to obtain the scoring probability based on user
Pr u i U ( S s ) = Num U ( S s ) / k - - - ( 1 )
In formula (1), NumU(Ss) gather F for the scoring of described neighbor useruiMiddle scoring SsThe number of times occurred;
6) by described scoring SsWith the described scoring probability based on userConstitute neighbor user to predict the outcome
Pr u i U = { ( S 1 , Pr u i U ( S 1 ) ) , ... , ( S s , Pr u i U ( S s ) ) , ... , ( S | S | , Pr u i U ( S | S | ) ) } - - - ( 2 )
In formula (2), Pr u i U ( S s ) &Element; &lsqb; 0 , 1 &rsqb; ;
Described project-based collaborative filtering method is to carry out as follows:
1) by all users to described commodity IiThe set and the set of scoring of other commodity is utilized respectively constrained Pearson came relatedness metric method obtains described commodity I of markingiWith the commodity similarity set of other commodity, by other commodity according to the similarity size in described commodity similarity set carry out descending obtain preliminary neighbours commodity set Ni
2) by user UuIn set of markingIn corresponding commodity list be shown as scoring commodity set Ru
3) by described preliminary neighbours commodity set NiWith scoring commodity set RuFront k the commodity list occured simultaneously is shown as neighbours commodity set Niu
4) by user UuTo described neighbours commodity set NiuIn the grade form of each commodity be shown as neighbours' commodity scoring set Fiu
5) formula (3) is utilized to obtain project-based scoring probability
Pr u i I ( S s ) = Num I ( S s ) / k - - - ( 3 )
In formula (3), NumI(Ss) gather F for the scoring of described neighbours' commodityiuMiddle scoring SsThe number of times occurred;
6) by described scoring SsWith described project-based scoring probabilityComposition project neighbours predict the outcome
Pr u i I = { ( S 1 , Pr u i I ( S 1 ) ) , ... , ( S s , Pr u i I ( S s ) ) , ... , ( S | S | , Pr u i I ( S | S | ) ) } - - - ( 4 )
In formula (4), Pr u i I ( S s ) &Element; &lsqb; 0 , 1 &rsqb; .
CN201310637512.4A 2013-12-02 2013-12-02 A kind of based on the mixing recommendation method recommending probability fusion Active CN103632290B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310637512.4A CN103632290B (en) 2013-12-02 2013-12-02 A kind of based on the mixing recommendation method recommending probability fusion

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310637512.4A CN103632290B (en) 2013-12-02 2013-12-02 A kind of based on the mixing recommendation method recommending probability fusion

Publications (2)

Publication Number Publication Date
CN103632290A CN103632290A (en) 2014-03-12
CN103632290B true CN103632290B (en) 2016-06-29

Family

ID=50213310

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310637512.4A Active CN103632290B (en) 2013-12-02 2013-12-02 A kind of based on the mixing recommendation method recommending probability fusion

Country Status (1)

Country Link
CN (1) CN103632290B (en)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105989510A (en) * 2015-02-06 2016-10-05 展讯通信(上海)有限公司 Online goods recommending system and device based on neural network, and mobile terminal
CN105761102B (en) * 2016-02-04 2021-05-11 杭州朗和科技有限公司 Method and device for predicting commodity purchasing behavior of user
CN105761107A (en) * 2016-02-15 2016-07-13 深圳市非零无限科技有限公司 Method for acquiring target new users in internet products and device thereof
CN107292466A (en) * 2016-03-31 2017-10-24 深圳光启合众科技有限公司 Possess the artificial intelligence system and its evaluation method of evaluating ability
CN106446195A (en) * 2016-09-29 2017-02-22 北京百度网讯科技有限公司 News recommending method and device based on artificial intelligence
CN107133836A (en) * 2017-03-22 2017-09-05 无锡中科富农物联科技有限公司 A kind of adaptive weighting combined recommendation algorithm
CN107798045A (en) * 2017-07-24 2018-03-13 中南大学 User towards middle-size and small-size website, which accesses, is intended to acquisition methods and system
CN108648072A (en) * 2018-05-18 2018-10-12 深圳灰猫科技有限公司 Internet finance lending risk evaluating system based on user credit dynamic grading
CN109032591B (en) * 2018-06-21 2021-04-09 北京航空航天大学 Crowdsourcing software developer recommendation method based on meta-learning
CN110598092A (en) * 2019-08-12 2019-12-20 深圳市天天学农网络科技有限公司 Content recommendation method
CN110689383B (en) * 2019-10-12 2023-08-22 腾讯科技(深圳)有限公司 Information pushing method, device, server and storage medium
CN111291273A (en) * 2020-02-20 2020-06-16 深圳前海微众银行股份有限公司 Recommendation system optimization method, device, equipment and readable storage medium
CN113221003B (en) * 2021-05-20 2023-05-02 北京建筑大学 Mixed filtering recommendation method and system based on dual theory

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102135999A (en) * 2011-03-25 2011-07-27 南京财经大学 User credibility and item nearest neighbor combination Internet recommendation method
CN102982107A (en) * 2012-11-08 2013-03-20 北京航空航天大学 Recommendation system optimization method with information of user and item and context attribute integrated

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102135999A (en) * 2011-03-25 2011-07-27 南京财经大学 User credibility and item nearest neighbor combination Internet recommendation method
CN102982107A (en) * 2012-11-08 2013-03-20 北京航空航天大学 Recommendation system optimization method with information of user and item and context attribute integrated

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Maximizing customer satisfaction through an online recommendation system:A novel associative classification model;Yuanchun Jiang等;《Decision Support Systems》;20100228;第48卷(第3期);全文 *
基于用户—项目的混合协同过滤技术的应用研究;谌彦妮;《中国优秀硕士学位论文全文数据库信息科技辑》;20120415(第4期);全文 *

Also Published As

Publication number Publication date
CN103632290A (en) 2014-03-12

Similar Documents

Publication Publication Date Title
CN103632290B (en) A kind of based on the mixing recommendation method recommending probability fusion
CN102982107B (en) A kind of commending system optimization method merging user, project and context property information
CN106651519B (en) Personalized recommendation method and system based on label information
CN104391849B (en) Incorporate the collaborative filtering recommending method of time contextual information
CN103617289B (en) Micro-blog recommendation method based on user characteristics and cyberrelationship
CN107833117A (en) A kind of Bayes&#39;s personalized ordering for considering label information recommends method
CN105045907A (en) Method for constructing visual attention-label-user interest tree for personalized social image recommendation
CN104166732B (en) Project collaboration filtering recommendation method based on global scoring information
CN103761237A (en) Collaborative filtering recommending method based on characteristics and credibility of users
CN102231166A (en) Collaborative recommendation method based on social context
CN107330727A (en) A kind of personalized recommendation method based on hidden semantic model
CN102495864A (en) Collaborative filtering recommending method and system based on grading
CN102841929A (en) Recommending method integrating user and project rating and characteristic factors
CN108198045A (en) The design method of mixing commending system based on e-commerce website data mining
CN104598450A (en) Popularity analysis method and system of network public opinion event
CN105138508A (en) Preference diffusion based context recommendation system
CN106682121A (en) Time utility recommendation method based on interest change of user
CN104239399A (en) Method for recommending potential friends in social network
CN107016122A (en) Knowledge recommendation method based on time-shift
Setiadi et al. The Impact of Brand Awareness and Country of Origin on Purchase Intention with Mediation of Self Congruity on Chinese Brand Automotive Products Wuling
CN104239496A (en) Collaborative filtering method based on integration of fuzzy weight similarity measurement and clustering
CN105678590A (en) topN recommendation method for social network based on cloud model
Li et al. Collaborative filtering based on user attributes and user ratings for restaurant recommendation
CN106919699A (en) A kind of recommendation method for personalized information towards large-scale consumer
CN105761154A (en) Socialized recommendation method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant