CN104281956A - Dynamic recommendation method capable of adapting to user interest changes based on time information - Google Patents

Dynamic recommendation method capable of adapting to user interest changes based on time information Download PDF

Info

Publication number
CN104281956A
CN104281956A CN201410583981.7A CN201410583981A CN104281956A CN 104281956 A CN104281956 A CN 104281956A CN 201410583981 A CN201410583981 A CN 201410583981A CN 104281956 A CN104281956 A CN 104281956A
Authority
CN
China
Prior art keywords
user
article
scoring
recommendation method
users
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.)
Granted
Application number
CN201410583981.7A
Other languages
Chinese (zh)
Other versions
CN104281956B (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.)
TIANJIN YIPOINT TECHNOLOGY Co.,Ltd.
Original Assignee
Nanjing University of Information Science and 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 Nanjing University of Information Science and Technology filed Critical Nanjing University of Information Science and Technology
Priority to CN201410583981.7A priority Critical patent/CN104281956B/en
Publication of CN104281956A publication Critical patent/CN104281956A/en
Application granted granted Critical
Publication of CN104281956B publication Critical patent/CN104281956B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to a dynamic recommendation method capable of adapting to user interest changes based on time information. The method comprises the steps that a user-object explicit rating matrix is built; a user-object implicit rating matrix is built; a user-object comprehensive rating matrix is built; similarity between two users is calculated; K users close to the target user similarity are obtained as the neighbour set of target users; a monotone decreasing exponential time function is selected as a rating weighting function, and the weighting factor of each user in the rating weighting function is calculated according to different interest change trends embodied by the scores of the users; a TOP-N recommendation method is adopted, and N objects with very top predication scores are recommended to the users. According to the method, the changes of the user interest along with time are considered, and the more precise personalized object recommendation service is provided for the users.

Description

Based on the dynamic recommendation method that the adaptation user interest of temporal information changes
Technical field
The present invention relates to personalized recommendation method technical field, especially based on the dynamic recommendation method that the adaptation user interest of temporal information changes.
Background technology
Flourish along with infotech, a large amount of information is presented in daily life.Traditional network service, such as split catalog, search engine, can not meet the demand of people to information, alleviate network information overload problem and become one of current significant challenge, commending system arises at the historic moment in this context, is one of effective way promoting e-commerce development at present.Its main task analyzes the buying behavior of user, specifies the purchasing demand of user, for user recommends its interested commodity do not bought.
The interest of the score data analysis user that traditional Collaborative Filtering Recommendation Algorithm is produced by user, the scoring of user in different time is considered as same weight, but, in the buying behavior data of reality, the interest of user is constantly change, cause like this and recommend inaccurate problem, the up-to-date article of user can not be recommended in time.
Summary of the invention
In view of weak point of the prior art, the invention provides the dynamic recommendation method that a kind of adaptation user interest based on temporal information changes, comprise the following steps:
Step one, basis collect the scoring list of the user-article obtained from e-commerce website, build the explicit rating matrix of user-article;
Step 2, quantification treatment is carried out to the comprising click, collect, add shopping cart of user, the implicit feedback behavioural information of purchase, then build the implicit scores matrix of user-article;
Step 3, utilize step one and step 2 result build user-article comprehensive grading matrix;
Step 4, according to Person formula of correlation coefficient, calculate the similarity between two two users;
Step 5, carry out descending sort according to similarity size between user, obtain the K position user forward with targeted customer's similarity and gather as the neighbour of targeted customer;
Step 6, choose monotone decreasing exponential time function as scoring weighting function, different according to the interests change trend that the scoring of user embodies, calculate the weight factor of every user in scoring weighting function;
Step 7, introducing scoring weighting function improve score in predicting formula, and target of prediction user is to the score value of article of not marking;
N item article forward for prediction score are recommended user by step 8, employing TOP-N recommend method.
Wherein in step one, the scoring scope of user to article is the integer got between 1-5.Meanwhile, the row of explicit rating matrix represents user, and article are shown in list, if certain user does not mark to certain article, then corresponding matrix entries element is empty.
In step 2 when certain user does not produce explicit scoring to certain article, just quantize the carrying out of user concealed behavior, definition purchase is 5 points, and adding shopping cart is 4 points, and collection is 3 points, clicks twice and is 2 points above, clicks and is once 1 point.
In step 3, the obtaining value method of comprehensive grading is: if user gives explicit scoring to article, then this score value is comprehensive grading; If user does not give scoring to article, then quantize the implicit expression behavior in step 2, namely the quantized value obtained is comprehensive grading.
The detailed process of step 6 is: by exponential time function f (t) of monotone decreasing=e -ω tbe multiplied by the scoring of user to article, the scoring weight of adjustment user, namely give larger weight to the score value of the article that user accesses in the recent period, the score value of the article of past access gives less weight.Because the interests change trend of each user is different, so give every user different personalized factor ω, wherein, calculate ω to need to classify according to the classification belonging to article to the article of user's scoring, be simultaneously a time period divide the scoring time of article according to three months according to user, counting user within each time period to the scoring behavior of a certain class article, if there is scoring behavior to be just designated as 1, otherwise be designated as 0, simultaneously the actual scoring number of counting user in some time periods to a certain class article.
The present invention is directed to the collaborative filtering recommending method that e-commerce website uses to improve, binding time information, consider user interest over time, for it provides more accurate personalized article recommendation service.Fully take into account a lot of user may unwilling cost thought mark to article simultaneously, the explicit scoring caused is little, make the problem that the result of recommendation is not accurate enough, be combined the quantification of the implicit feedback behavioural information for user, effectively alleviate the openness problem of data.Relative to traditional collaborative filtering recommending method, be particularly suitable for doing personalized precisely recommendation, for ecommerce brings better benefit to user in ecommerce.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the dynamic recommendation method of the adaptation user interest change that the present invention is based on temporal information;
Fig. 2 is user-article comprehensive grading table;
Fig. 3 is the score data table of user-article;
Fig. 4 is the Neighborhood Model table of targeted customer;
Fig. 5 is user interest sorted table.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
As shown in Figure 1, this method comprises following steps:
S10, definition user collects U={u 1, u 2..., u m, m represents total number of users, article collection P={p 1, p 2..., p n, n represents total number of items, X representative scoring item x i, jthe explicit rating matrix of m*n, x i, jrepresent that user i is to the explicit scoring of article j, wherein, 1≤i≤m, 1≤j≤n, x i, jspan be { 1,2,3,4,5}.If certain user i comments too to article j, then corresponding matrix entries x i, jfor sky.So by m position user, the explicit rating matrix X of the user-article of n article structure is designated as:
S20, if certain user i comments too to article j, then analyzes the implicit feedback behavior of this user to these article, is carried out quantification treatment, if this user i does not also produce implicit expression behavior to article j, then and corresponding matrix entries y i, jfor sky.
The quantizing rule of user concealed feedback behavioural information is:
1) if. user have purchased article, so y i, j=5;
2) if. user i adds shopping cart article j, so y i, j=4;
3) if. user i has collected article j, so y i, j=3;
4) if. user i clicks article j for many times, so y i, j=2;
5) if. user i only clicks article j, so a y i, j=1;
Then the implicit scores matrix Y of user-article is designated as:
S30, the explicit rating matrix of user-article built in conjunction with S10 and S20 and the implicit scores matrix of user-article, finally build the comprehensive grading matrix R of user-article, definition r i, jrepresent the explicit scoring of user i to article j and the comprehensive grading of implicit scores, if user has explicit scoring to article, this explicit scoring is comprehensive grading.
Comprehensive grading r i, jvalue formula as follows:
The comprehensive grading matrix R of so final user-article is designated as:
Final comprehensive grading table as shown in Figure 2.
S40, utilizes Pearson correlation coefficient formula, calculate two user i, v based on article scoring between similarity:
sim ( i , v ) = Σ j ∈ cn ( r i , j - r i ‾ ) ( r v , j - r v ‾ ) Σ j ∈ cn ( r i , j - r i ‾ ) 2 Σ j ∈ cn ( r v , j - r v ‾ ) 2
Wherein r i, j, r v, jexpression user i, v are to the scoring of article j respectively, represent user i respectively, the average score of v, cn represents the article of both common scorings.
Such as, in calculating chart 3 targeted customer tar respectively with user a, the similarity of b, c:
The average score of targeted customer tar is:
The similarity of targeted customer tar and user a is:
sim ( tar , a ) = ( 5 - 4 ) * ( 3 - 2.25 ) + ( 3 - 4 ) * ( 2 - 2.25 ) ( 5 - 4 ) 2 + ( 3 - 2.25 ) 2 * ( 3 - 4 ) 2 + ( 2 - 2.25 ) 2 = 0.78 ,
sim(tar,b)=0.00sim(tar,c)=0.89sim(tar,d)=-0.80
S50, carries out descending sort according to sim (i, v) size, obtains the neighbour of targeted customer as shown in Figure 4, wherein, and sim (i, v 1) > sim (i, v 2) > ... > sim (i, v m-1), obtain and gather as the neighbour of targeted customer with the forward K position user of targeted customer's similarity.
Clearly, as K=2, according to the result of calculation of S40, choose user a and user c and collect as the neighbour user of targeted customer tar.
S60, introduces exponential time function f (t)=e -ω tas scoring weight, it is the function of a monotone decreasing, and the value of t is larger, and the value of f (t) is less.And, because the interests change trend of each user is different, so every user should be given different personalized weight factor ω, ω is larger, represent that interest decays faster in time, otherwise then slower, ω ∈ (0,1) .t represents the interval to the earliest time that article to be predicted are marked in current time in system and neighbour user.
1) first the article of user's scoring are classified according to the classification belonging to article, be simultaneously a time period divide the scoring time of article according to three months according to user, counting user within each time period to the scoring behavior of a certain class article, if there is scoring behavior to be just designated as 1, otherwise be designated as 0, the actual scoring number of counting user in some time periods to a certain class article simultaneously, concrete form is as Fig. 5.
2) calculate the ω value of every user, the computing formula of ω is: wherein, ω arepresent that user is to the personalized factor of category-A article interest-degree, N arepresent that user is to the scoring number of category-A article, n represents that user comments the total number of undue article, represent probability.
S ( i ) = 0 , no rating 1 , rating ( i = 1,2 , . . . , d )
Wherein, d represents time period sequence number.
Such as, statistics targeted customer tar was the categorize interests of a time period according to three months in 1 year, as shown in Figure 5.So, user tar is to the personalized factor of category-A article interest-degree
S70, will mark weighting function f (t ij) introducing score in predicting formula, target of prediction user is to the score value of article of not marking.
The score in predicting formula introduced after scoring weight is:
P i , j = r i ‾ + Σ v ∈ N i sim ( i , v ) ( r v , j - r v ‾ ) f ( t ij ) Σ v ∈ N i sim ( i , v )
Wherein, P i, jrepresent that user i marks to the prediction of article j, N ifor the neighbour user of user i, with represent user i respectively, the average mark of v scoring, r v, jrepresent that neighbour user v is to the score value of article j, f (t i, j) represent that user i is to the scoring weighting function of article j.
Such as, in prognostic chart 3 targeted customer tar to the article Item that do not mark 2scoring, suppose Item 2belong to category-A article, and the current time in system is July 18, neighbour user a and c of targeted customer tar is to Item 2the scoring time be respectively July 17 and July 16, then according to the implication of t in S60, time interval t should value be 2.So,
P tar , Item 2 = 4 + 0.78 * e - 0.9 * 2 * ( 1 - 2.25 ) + 0.89 * e - 0.9 * 2 * ( 3 - 3 ) 0.78 + 0.89 = 3.90
In like manner, Item is supposed 4belong to D class article, then ω d=0.6, as time interval t=2
S80, adopts TOP-N recommend method, and N item article forward for prediction score are recommended user.Such as N=1, because so article Item 4recommend targeted customer.
Be more than better embodiment of the present invention, but protection scope of the present invention is not limited thereto.Any those of ordinary skill in the art are in the technical scope disclosed by the present invention, and the conversion expected without creative work or replacement, all should be encompassed within protection scope of the present invention.Therefore the protection domain that protection scope of the present invention should limit with claim is as the criterion.

Claims (4)

1., based on the dynamic recommendation method that the adaptation user interest of temporal information changes, it is characterized in that, comprise the following steps:
Step one, basis collect the scoring list of the user-article obtained from e-commerce website, build the explicit rating matrix of user-article;
Step 2, quantification treatment is carried out to the comprising click, collect, add shopping cart of user, the implicit feedback behavioural information of purchase, then build the implicit scores matrix of user-article;
Step 3, utilize step one and step 2 result build user-article comprehensive grading matrix;
Step 4, according to Person formula of correlation coefficient, calculate the similarity between two two users;
Step 5, carry out descending sort according to similarity size between user, obtain the K position user forward with targeted customer's similarity and gather as the neighbour of targeted customer;
Step 6, choose monotone decreasing exponential time function as scoring weighting function, different according to the interests change trend that the scoring of user embodies, calculate the weight factor of every user in scoring weighting function;
Step 7, introducing scoring weighting function improve score in predicting formula, and target of prediction user is to the score value of article of not marking;
N item article forward for prediction score are recommended user by step 8, employing TOP-N recommend method.
2. the dynamic recommendation method that changes of the adaptation user interest based on temporal information according to claim 1, it is characterized in that, in described step one, the scoring scope of user to article is the integer got between 1 ~ 5, does not have the matrix entries element of marking for empty.
3. the dynamic recommendation method that changes of the adaptation user interest based on temporal information according to claim 1, it is characterized in that, when in described step 2, user does not produce explicit scoring to certain article, then user concealed behavior is quantized, purchase is 5 points, and adding shopping cart is 4 points, and collection is 3 points, click twice and be 2 points above, clicking and be once 1 point.
4. the dynamic recommendation method that changes of the adaptation user interest based on temporal information according to claim 1, it is characterized in that, described step 6 detailed process is: by exponential time function f (t)=e- ω tbe multiplied by the scoring of user to article, the scoring weight of adjustment user, namely give larger weight to the score value of the article that user accesses in the recent period, the score value of the article of past access gives less weight, wherein ω arepresent that user is to the personalized factor of category-A article interest-degree, N arepresent that user is to the scoring number of category-A article, n represents that user comments the total number of undue article, represent probability.
CN201410583981.7A 2014-10-27 2014-10-27 The dynamic recommendation method for adapting to user interest variation based on temporal information Active CN104281956B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410583981.7A CN104281956B (en) 2014-10-27 2014-10-27 The dynamic recommendation method for adapting to user interest variation based on temporal information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410583981.7A CN104281956B (en) 2014-10-27 2014-10-27 The dynamic recommendation method for adapting to user interest variation based on temporal information

Publications (2)

Publication Number Publication Date
CN104281956A true CN104281956A (en) 2015-01-14
CN104281956B CN104281956B (en) 2018-09-07

Family

ID=52256810

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410583981.7A Active CN104281956B (en) 2014-10-27 2014-10-27 The dynamic recommendation method for adapting to user interest variation based on temporal information

Country Status (1)

Country Link
CN (1) CN104281956B (en)

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104809243A (en) * 2015-05-15 2015-07-29 东南大学 Mixed recommendation method based on excavation of user behavior compositing factor
CN106204153A (en) * 2016-07-14 2016-12-07 扬州大学 A kind of two-staged prediction Top N proposed algorithm based on attribute proportion similarity
CN106570008A (en) * 2015-10-09 2017-04-19 阿里巴巴集团控股有限公司 Recommendation method and device
CN106649522A (en) * 2016-10-18 2017-05-10 江西博瑞彤芸科技有限公司 User information acquisition method based on push message
CN106708938A (en) * 2016-11-18 2017-05-24 北京大米科技有限公司 Method and device for assisting recommendation
CN106777051A (en) * 2016-12-09 2017-05-31 重庆邮电大学 A kind of many feedback collaborative filtering recommending methods based on user's group
CN106991199A (en) * 2017-06-07 2017-07-28 上海理工大学 The commending system score in predicting of probability is inclined to recommending method based on user behavior
WO2017133007A1 (en) * 2016-02-05 2017-08-10 Hewlett Packard Enterprise Development Lp User interest and relationship determination
CN108288220A (en) * 2018-04-04 2018-07-17 梧州井儿铺贸易有限公司 A kind of Technologies of Recommendation System in E-Commerce based on user interest variation
CN108305091A (en) * 2017-01-13 2018-07-20 北京京东尚科信息技术有限公司 Electronic equipment, user's perceptibility extracting method interested and device
CN104966125B (en) * 2015-05-06 2018-07-24 同济大学 A kind of article scoring of social networks and recommend method
CN108460619A (en) * 2018-01-16 2018-08-28 杭州电子科技大学 A kind of fusion shows the Collaborative Recommendation model of implicit feedback
WO2018218403A1 (en) * 2017-05-27 2018-12-06 深圳大学 Content pushing method and device
CN108960954A (en) * 2017-08-03 2018-12-07 中国人民解放军国防科学技术大学 A kind of content recommendation method and recommender system based on user group behavior feedback
CN109272367A (en) * 2017-07-17 2019-01-25 北京京东尚科信息技术有限公司 Information processing method and device
CN109684538A (en) * 2018-12-03 2019-04-26 重庆邮电大学 A kind of recommended method and recommender system based on individual subscriber feature
CN109933720A (en) * 2019-01-29 2019-06-25 汕头大学 A kind of dynamic recommendation method based on user interest Adaptive evolution
CN110688582A (en) * 2019-11-12 2020-01-14 广东小天才科技有限公司 Application recommendation method, application recommendation device and terminal equipment
CN111339434A (en) * 2018-12-03 2020-06-26 阿里巴巴集团控股有限公司 Information recommendation method and device, electronic equipment and computer storage medium
WO2020168992A1 (en) * 2019-02-18 2020-08-27 苏州大学 Product recommendation method, apparatus, and device and storage medium
CN111984873A (en) * 2020-09-21 2020-11-24 北京信息科技大学 Service recommendation system and method
CN113051527A (en) * 2019-12-27 2021-06-29 上海数康企业管理咨询有限公司 RFA client behavior scoring method and system
CN113204713A (en) * 2021-07-05 2021-08-03 南京信息工程大学 Core user and core article mining method in large-scale commodity sales
CN117132356A (en) * 2023-08-29 2023-11-28 重庆大学 Recommendation method, device and system based on self-adaptive user interest change period

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617540A (en) * 2013-10-17 2014-03-05 浙江大学 E-commerce recommendation method of tracking user interest changes
CN103745100A (en) * 2013-12-27 2014-04-23 浙江大学 Item-based explicit and implicit feedback mixing collaborative filtering recommendation algorithm
CN104063481A (en) * 2014-07-02 2014-09-24 山东大学 Film individuation recommendation method based on user real-time interest vectors

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617540A (en) * 2013-10-17 2014-03-05 浙江大学 E-commerce recommendation method of tracking user interest changes
CN103745100A (en) * 2013-12-27 2014-04-23 浙江大学 Item-based explicit and implicit feedback mixing collaborative filtering recommendation algorithm
CN104063481A (en) * 2014-07-02 2014-09-24 山东大学 Film individuation recommendation method based on user real-time interest vectors

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赖雯: ""协同过滤推荐系统的用户兴趣变化和稀疏性问题研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104966125B (en) * 2015-05-06 2018-07-24 同济大学 A kind of article scoring of social networks and recommend method
CN104809243B (en) * 2015-05-15 2017-11-17 东南大学 It is a kind of that method is recommended based on the mixing excavated to user behavior composite factor
CN104809243A (en) * 2015-05-15 2015-07-29 东南大学 Mixed recommendation method based on excavation of user behavior compositing factor
CN106570008A (en) * 2015-10-09 2017-04-19 阿里巴巴集团控股有限公司 Recommendation method and device
CN106570008B (en) * 2015-10-09 2020-03-27 阿里巴巴集团控股有限公司 Recommendation method and device
WO2017133007A1 (en) * 2016-02-05 2017-08-10 Hewlett Packard Enterprise Development Lp User interest and relationship determination
CN106204153A (en) * 2016-07-14 2016-12-07 扬州大学 A kind of two-staged prediction Top N proposed algorithm based on attribute proportion similarity
CN106649522A (en) * 2016-10-18 2017-05-10 江西博瑞彤芸科技有限公司 User information acquisition method based on push message
CN106708938A (en) * 2016-11-18 2017-05-24 北京大米科技有限公司 Method and device for assisting recommendation
CN106777051A (en) * 2016-12-09 2017-05-31 重庆邮电大学 A kind of many feedback collaborative filtering recommending methods based on user's group
CN108305091A (en) * 2017-01-13 2018-07-20 北京京东尚科信息技术有限公司 Electronic equipment, user's perceptibility extracting method interested and device
CN108305091B (en) * 2017-01-13 2022-04-26 北京京东尚科信息技术有限公司 Electronic equipment, user interest perception degree extraction method and device
WO2018218403A1 (en) * 2017-05-27 2018-12-06 深圳大学 Content pushing method and device
CN106991199B (en) * 2017-06-07 2020-07-14 上海理工大学 User behavior tendency probability-based recommendation system score prediction and recommendation method
CN106991199A (en) * 2017-06-07 2017-07-28 上海理工大学 The commending system score in predicting of probability is inclined to recommending method based on user behavior
CN109272367A (en) * 2017-07-17 2019-01-25 北京京东尚科信息技术有限公司 Information processing method and device
CN108960954A (en) * 2017-08-03 2018-12-07 中国人民解放军国防科学技术大学 A kind of content recommendation method and recommender system based on user group behavior feedback
CN108960954B (en) * 2017-08-03 2021-09-14 中国人民解放军国防科学技术大学 Content recommendation method and system based on user group behavior feedback
CN108460619A (en) * 2018-01-16 2018-08-28 杭州电子科技大学 A kind of fusion shows the Collaborative Recommendation model of implicit feedback
CN108288220A (en) * 2018-04-04 2018-07-17 梧州井儿铺贸易有限公司 A kind of Technologies of Recommendation System in E-Commerce based on user interest variation
CN109684538A (en) * 2018-12-03 2019-04-26 重庆邮电大学 A kind of recommended method and recommender system based on individual subscriber feature
CN111339434B (en) * 2018-12-03 2023-04-28 阿里巴巴集团控股有限公司 Information recommendation method and device, electronic equipment and computer storage medium
CN111339434A (en) * 2018-12-03 2020-06-26 阿里巴巴集团控股有限公司 Information recommendation method and device, electronic equipment and computer storage medium
CN109933720B (en) * 2019-01-29 2023-03-10 汕头大学 Dynamic recommendation method based on user interest adaptive evolution
CN109933720A (en) * 2019-01-29 2019-06-25 汕头大学 A kind of dynamic recommendation method based on user interest Adaptive evolution
WO2020168992A1 (en) * 2019-02-18 2020-08-27 苏州大学 Product recommendation method, apparatus, and device and storage medium
CN110688582B (en) * 2019-11-12 2022-10-18 广东小天才科技有限公司 Application recommendation method, application recommendation device and terminal equipment
CN110688582A (en) * 2019-11-12 2020-01-14 广东小天才科技有限公司 Application recommendation method, application recommendation device and terminal equipment
CN113051527A (en) * 2019-12-27 2021-06-29 上海数康企业管理咨询有限公司 RFA client behavior scoring method and system
CN111984873B (en) * 2020-09-21 2023-04-25 北京信息科技大学 Service recommendation system and method
CN111984873A (en) * 2020-09-21 2020-11-24 北京信息科技大学 Service recommendation system and method
CN113204713A (en) * 2021-07-05 2021-08-03 南京信息工程大学 Core user and core article mining method in large-scale commodity sales
CN117132356A (en) * 2023-08-29 2023-11-28 重庆大学 Recommendation method, device and system based on self-adaptive user interest change period
CN117132356B (en) * 2023-08-29 2024-02-13 重庆大学 Recommendation method, device and system based on self-adaptive user interest change period

Also Published As

Publication number Publication date
CN104281956B (en) 2018-09-07

Similar Documents

Publication Publication Date Title
CN104281956A (en) Dynamic recommendation method capable of adapting to user interest changes based on time information
CN104391849B (en) Incorporate the collaborative filtering recommending method of time contextual information
Cheng et al. Personalized click prediction in sponsored search
CN102629257B (en) Commodity recommending method of e-commerce website based on keywords
CN107909433A (en) A kind of Method of Commodity Recommendation based on big data mobile e-business
CN107465754B (en) News recommendation method and device
CN106600372A (en) Commodity recommending method and system based on user behaviors
CN104252456B (en) A kind of weight method of estimation, apparatus and system
CN103473354A (en) Insurance recommendation system framework and insurance recommendation method based on e-commerce platform
CN102902691A (en) Recommending method and recommending system
JP5615857B2 (en) Analysis apparatus, analysis method, and analysis program
CN104346425B (en) A kind of method and system of the internet public feelings index system of stratification
CN105976229A (en) Collaborative filtering algorithm based on user and project mixing
CN104166732B (en) Project collaboration filtering recommendation method based on global scoring information
CN103745100A (en) Item-based explicit and implicit feedback mixing collaborative filtering recommendation algorithm
CN105426528A (en) Retrieving and ordering method and system for commodity data
CN104933622A (en) Microblog popularity degree prediction method based on user and microblog theme and microblog popularity degree prediction system based on user and microblog theme
CN101853470A (en) Collaborative filtering method based on socialized label
CN101271559A (en) Cooperation recommending system based on user partial interest digging
CN105023178B (en) A kind of electronic commerce recommending method based on ontology
CN106168953A (en) Blog article towards weak relation social networks recommends method
CN103886486A (en) Electronic commerce recommending method based on support vector machine (SVM)
CN105335518A (en) Method and device for generating user preference information
US20180139296A1 (en) Method of producing browsing attributes of users, and non-transitory computer-readable storage medium
CN103412865B (en) The Notification Method of website item and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190312

Address after: 401120 data of Xiantao street, Yubei District, Chongqing 19

Patentee after: Chongqing Wingshengda Technology Co., Ltd.

Address before: 210044 Ning six road, Nanjing, Jiangsu Province, No. 219

Patentee before: Nanjing University of Information Science and Technology

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200520

Address after: 300131 Third Floor of CIIC Building, 19 Xianyang Road, Hongqiao District, Tianjin

Patentee after: TIANJIN YIPOINT TECHNOLOGY Co.,Ltd.

Address before: 401120, Chongqing, Yubei District, Xiantao street, No. 19 East Valley Road

Patentee before: Chongqing Wingshengda Technology Co.,Ltd.