CN104915391A - Article recommendation method based on trust relationship - Google Patents
Article recommendation method based on trust relationship Download PDFInfo
- Publication number
 - CN104915391A CN104915391A CN201510272410.6A CN201510272410A CN104915391A CN 104915391 A CN104915391 A CN 104915391A CN 201510272410 A CN201510272410 A CN 201510272410A CN 104915391 A CN104915391 A CN 104915391A
 - Authority
 - CN
 - China
 - Prior art keywords
 - user
 - trust
 - model
 - recommended
 - old
 - 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
 
Links
Classifications
- 
        
- G—PHYSICS
 - G06—COMPUTING OR CALCULATING; COUNTING
 - G06F—ELECTRIC DIGITAL DATA PROCESSING
 - G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
 - G06F16/90—Details of database functions independent of the retrieved data types
 - G06F16/95—Retrieval from the web
 - G06F16/953—Querying, e.g. by the use of web search engines
 - G06F16/9535—Search customisation based on user profiles and personalisation
 
 
Landscapes
- Engineering & Computer Science (AREA)
 - Databases & Information Systems (AREA)
 - Theoretical Computer Science (AREA)
 - Data Mining & Analysis (AREA)
 - Physics & Mathematics (AREA)
 - General Engineering & Computer Science (AREA)
 - General Physics & Mathematics (AREA)
 - Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
 - Management, Administration, Business Operations System, And Electronic Commerce (AREA)
 
Abstract
本发明提供一种基于信任关系的物品推荐方法,包括如下步骤:建立用户模型和物品模型、建立旧用户-物品评分模型、用户-用户信任模型,确定被推荐用户;根据用户-用户信任模型,初始信任模型定义为直接信任;对于旧用户,根据旧用户-物品评分模型计算出被推荐用户与其他旧用户的相似度,结合被推荐用户的信任关系,整合得出被推荐用户的最相似用户集;对于新用户,根据新用户与旧用户之间信任关系计算出被推荐用户的最相似用户集;然后在最相似用户集上利用协同过滤算法预测物品评分,将高评分物品作为推荐。本发明能够解决往推荐系统中的数据稀疏性问题和用户冷启动问题。
The present invention provides a method for recommending items based on a trust relationship, which includes the following steps: establishing a user model and an item model, establishing an old user-item scoring model, and a user-user trust model, and determining the recommended user; according to the user-user trust model, The initial trust model is defined as direct trust; for old users, the similarity between the recommended user and other old users is calculated according to the old user-item scoring model, and the most similar user to the recommended user is obtained by combining the trust relationship of the recommended user For new users, calculate the most similar user set of the recommended user based on the trust relationship between new users and old users; then use the collaborative filtering algorithm to predict item ratings on the most similar user set, and use high-scoring items as recommendations. The invention can solve the data sparsity problem and the user cold start problem in the recommendation system.
Description
技术领域technical field
本发明属于人工智能领域,具体涉及一种基于信任关系的物品推荐方法。The invention belongs to the field of artificial intelligence, and in particular relates to an item recommendation method based on a trust relationship.
背景技术Background technique
随着信息技术和互联网的发展,用户信息、商品信息等各种数据呈指数增长,出现了“信息过载”,无论是信息消费者还是信息生产者都遇到了很大的挑战:作为信息消费者,如何从大量信息中找到自己感兴趣的信息是一件非常困难的事情;作为信息生产者,如何让自己生产的信息脱颖而出,受到广大用户的关注,也是一件非常困难的事情。推荐方法就是解决这一矛盾的重要工具。With the development of information technology and the Internet, various data such as user information and product information have grown exponentially, and "information overload" has appeared. Both information consumers and information producers have encountered great challenges: as information consumers , How to find the information you are interested in from a large amount of information is a very difficult thing; as an information producer, how to make the information you produce stand out and attract the attention of the majority of users is also a very difficult thing. The recommended method is an important tool to solve this contradiction.
目前,几乎所有大中型的网站,例如Facebook,Amazon,Netflix,淘宝网,豆瓣网等都不同程度的使用了各种形式的推荐方法,并且取得显著的效果。推荐方法已经成为电子商务、社交网络中的一项非常重要的技术,也产生了巨大的经济效益。推荐方法在理论和实践方面都得到了很大发展。At present, almost all large and medium-sized websites, such as Facebook, Amazon, Netflix, Taobao, Douban, etc., have used various forms of recommendation methods to varying degrees and achieved remarkable results. Recommendation methods have become a very important technology in e-commerce and social networks, and have also produced huge economic benefits. Recommendation methods have been greatly developed in both theory and practice.
目前涌现了各种各样的推荐算法,主要的方法有基于内容的推荐和协同过滤推荐。At present, various recommendation algorithms have emerged, and the main methods are content-based recommendation and collaborative filtering recommendation.
基于内容的推荐是根据用户的历史行为(如浏览记录、对项目的评价等)构造个人兴趣图谱和文档,计算被推荐项目与用户兴趣文档的相似度,将相似度高的项目推荐给用户,例如Pandora音乐网站,其音乐家和研究人员亲自听了上万首来自不同歌手的歌,然后对歌曲的不同特性(比如旋律、节奏、编曲和歌词等)进行标注,然后,Pandora会根据专家标注的基因计算歌曲的相似度,并给用户推荐和他之前喜欢的音乐在基因上相似的其他音乐。很显然,这种方式依赖于对项目属性的准确描述,需要大量的收集项目的属性信息,性能低,通常具有冷启动和扩展性的问题。Content-based recommendation is to construct a personal interest graph and document based on the user's historical behavior (such as browsing records, evaluation of items, etc.), calculate the similarity between the recommended item and the user's interest document, and recommend the item with high similarity to the user. For example, on the Pandora music website, its musicians and researchers personally listened to tens of thousands of songs from different singers, and then marked the different characteristics of the songs (such as melody, rhythm, arrangement and lyrics, etc.), and then Pandora will The annotated genes calculate the similarity of the songs and recommend other music to the user that is genetically similar to the music he previously liked. Obviously, this method relies on the accurate description of project attributes, requires a large amount of collection of project attribute information, has low performance, and usually has problems of cold start and scalability.
另一种主流的方法是协同过滤推荐。最早应用在邮件方法Tapestry中。协同过滤算法也分为基于用户的协同过滤和基于项目(物品)的协同过滤。基于用户的协同过滤算法给用户推荐和他兴趣相似的其他用户喜欢的物品,基于物品的协同过滤算法给用户推荐和他之前喜欢的物品相似的物品。举例来说,基于用户的协同过滤算法只需根据用户以往对物品的评分信息就可以计算用户之间的相似度,然后就可以把与目标用户(被推荐用户)相似度高的那些用户喜欢的东西推荐给目标用户。同理,基于物品的协同过滤算法可以根据物品被喜欢的用户计算物品之间的相似度,然后进行推荐。Another mainstream method is collaborative filtering recommendation. It was first used in the mail method Tapestry. Collaborative filtering algorithms are also divided into user-based collaborative filtering and item-based collaborative filtering. The user-based collaborative filtering algorithm recommends to the user other items that are similar to his interests, and the item-based collaborative filtering algorithm recommends to the user items that are similar to the items he liked before. For example, the user-based collaborative filtering algorithm only needs to calculate the similarity between users based on the user's rating information on items in the past, and then can use those users who are highly similar to the target user (recommended user) to like recommend things to target users. Similarly, the item-based collaborative filtering algorithm can calculate the similarity between items according to the users who like the items, and then make recommendations.
协同过滤算法很好的弥补了基于内容推荐算法的不足,凭借着自身简单高效的特点,在很多领域都被广泛应用,但是这种方法只依赖用户的历史评分信息,没有利用其他的数据,本身也存在着冷启动、数据稀疏等问题。The collaborative filtering algorithm makes up for the shortcomings of the content-based recommendation algorithm. With its simple and efficient characteristics, it is widely used in many fields. However, this method only relies on the user's historical rating information and does not use other data. There are also problems such as cold start and data sparseness.
近年来,国内外研究者们在基于信任计算和个性化推荐方面进行了大量研究,主要利用信任关系改善个性化推荐的性能,在一定程度上缓解了推荐的数据稀疏性问题,并取得了一定研究成果。然而已有方法主要关注用户显式信任关系的计算及其推理,很多有价值的隐式信任关系往往被忽略,且仅仅考虑了当前推荐平台上的信任关系。In recent years, researchers at home and abroad have done a lot of research on trust-based computing and personalized recommendation, mainly using trust relationships to improve the performance of personalized recommendation, which alleviates the data sparsity problem of recommendation to a certain extent, and has achieved certain results. Research results. However, the existing methods mainly focus on the calculation and reasoning of users' explicit trust relationship, and many valuable implicit trust relationships are often ignored, and only the trust relationship on the current recommendation platform is considered.
因此,需要一种更加有效地解决冷启动用户和数据稀疏问题的推荐方法。Therefore, there is a need for a recommendation method that more effectively addresses the problems of cold-start users and data sparsity.
发明内容Contents of the invention
本发明针对上述现有技术存在的问题作出改进,即本发明要解决的技术问题是提供一种基于信任关系的物品推荐方法,能够解决往推荐系统中的数据稀疏性问题和冷启动用户问题。The present invention makes improvements to the problems existing in the above-mentioned prior art, that is, the technical problem to be solved by the present invention is to provide an item recommendation method based on a trust relationship, which can solve the data sparsity problem and the cold-start user problem in the recommendation system.
为了解决上述技术问题,本发明提供了如下的技术方案:In order to solve the problems of the technologies described above, the present invention provides the following technical solutions:
一种基于信任关系的物品推荐方法,包括如下步骤:An item recommendation method based on a trust relationship, comprising the following steps:
S1、建立用户模型和物品模型、建立旧用户-物品评分模型、用户-用户信任模型,确定被推荐用户;S1. Establish user model and item model, establish old user-item scoring model, user-user trust model, and determine recommended users;
S2、根据用户-用户信任模型,初始信任模型定义为直接信任;系统定义如果用户A直接信任用户B,用户B直接信任用户C,且用户A在初始状态和用户C没有直接信任关系,那么定义用户A间接信任用户C,这种情况为1步传递;以此类推2步传递和3步传递,并在传递过程中加入信任衰减;计算出被推荐用户的所有信任关系;S2. According to the user-user trust model, the initial trust model is defined as direct trust; the system defines that if user A directly trusts user B, user B directly trusts user C, and user A has no direct trust relationship with user C in the initial state, then define User A indirectly trusts user C, which is 1-step transfer; and so on, 2-step transfer and 3-step transfer, and trust decay is added in the transfer process; all trust relationships of recommended users are calculated;
S3、对于旧用户,根据旧用户-物品评分模型计算出被推荐用户与其他旧用户的相似度,结合被推荐用户的信任关系,整合得出被推荐用户的最相似用户集;对于新用户,根据新用户与旧用户之间信任关系计算出被推荐用户的最相似用户集;然后在最相似用户集上利用协同过滤算法预测物品评分,将高评分物品作为推荐。S3. For old users, calculate the similarity between the recommended user and other old users according to the old user-item scoring model, and combine the trust relationship of the recommended user to obtain the most similar user set of the recommended user; for new users, According to the trust relationship between the new user and the old user, the most similar user set of the recommended user is calculated; then the collaborative filtering algorithm is used to predict the item rating on the most similar user set, and the high-scoring item is recommended as a recommendation.
所述用户模型的建立:根据用户历史记录,包括购买的物品和对物品的评分和用户之间的联系建立用户模型;对于新用户,系统导入互联网上此用户与其他旧用户之间的联系,建立用户模型。The establishment of the user model: according to the user history records, including the items purchased and the ratings of the items and the connection between the users to establish the user model; for new users, the system imports the connections between this user and other old users on the Internet, Build user models.
本发明的有益效果是:本发明基于协同过滤算法,结合用户历史信息和用户之间的信任关系,并对信任网络进行信任传递,发现用户间潜在的间接信任关系,解决了数据稀疏问题。对于冷启动用户,系统通过导入其他网站的用户联系,进行信任传递,从而实现较高准确率的推荐。The beneficial effects of the present invention are: based on a collaborative filtering algorithm, the present invention combines user historical information and trust relationships between users, and conducts trust transfer to the trust network, discovers potential indirect trust relationships between users, and solves the problem of data sparseness. For cold-start users, the system transfers trust by importing user contacts from other websites, so as to achieve high-accuracy recommendations.
附图说明Description of drawings
附图用来提供对本发明的进一步理解,并且构成说明书的一部分,与本发明的实施例一起用于解释本发明,并不构成对本发明的限制。在附图中:The accompanying drawings are used to provide a further understanding of the present invention, and constitute a part of the description, and are used together with the embodiments of the present invention to explain the present invention, and do not constitute a limitation to the present invention. In the attached picture:
图1为信任传递原理示意图;Figure 1 is a schematic diagram of the principle of trust transfer;
图2为基于信任关系的物品推荐系统的流程图。Fig. 2 is a flowchart of an item recommendation system based on trust relationship.
具体实施方式Detailed ways
如图1-2所示,本发明公开一种基于信任关系的物品推荐方法,包括如下步骤:As shown in Figure 1-2, the present invention discloses a method for recommending items based on a trust relationship, which includes the following steps:
S1、建立用户模型和物品模型、建立旧用户-物品评分模型、用户-用户信任模型,确定被推荐用户;S1. Establish user model and item model, establish old user-item scoring model, user-user trust model, and determine recommended users;
S2、根据用户-用户信任模型,初始信任模型定义为直接信任;系统定义如果用户A直接信任用户B,用户B直接信任用户C,且用户A在初始状态和用户C没有直接信任关系,那么定义用户A间接信任用户C,这种情况为1步传递;以此类推2步传递和3步传递,并在传递过程中加入信任衰减;计算出被推荐用户的所有信任关系;S2. According to the user-user trust model, the initial trust model is defined as direct trust; the system defines that if user A directly trusts user B, user B directly trusts user C, and user A has no direct trust relationship with user C in the initial state, then define User A indirectly trusts user C, which is 1-step transfer; and so on, 2-step transfer and 3-step transfer, and trust decay is added in the transfer process; all trust relationships of recommended users are calculated;
S3、对于旧用户,根据旧用户-物品评分模型计算出被推荐用户与其他旧用户的相似度,结合被推荐用户的信任关系,整合得出被推荐用户的最相似用户集;对于新用户,根据新用户与旧用户之间信任关系计算出被推荐用户的最相似用户集;然后在最相似用户集上利用协同过滤算法预测物品评分,将高评分物品作为推荐。S3. For old users, calculate the similarity between the recommended user and other old users according to the old user-item scoring model, and combine the trust relationship of the recommended user to obtain the most similar user set of the recommended user; for new users, According to the trust relationship between the new user and the old user, the most similar user set of the recommended user is calculated; then the collaborative filtering algorithm is used to predict the item rating on the most similar user set, and the high-scoring item is recommended as a recommendation.
本发明针对当前使用广泛的推荐系统,基于协同过滤算法,结合用户历史信息和用户之间的信任关系,并对信任网络进行信任传递来增强推荐的效果。下面结合使用实施例对本发明进行详细描述。Aiming at the currently widely used recommendation system, the present invention is based on a collaborative filtering algorithm, combines user history information and trust relationships between users, and transfers trust to a trust network to enhance the effect of recommendation. The present invention will be described in detail below in conjunction with examples.
图1是对本发明的信任传递理论的描述,每个节点代表一个用户,箭头代表直接信任关系,例如用户A直接信任用户B和用户D,用户B直接信任用户C。根据信任传递理论,用户A通过1步传递间接信任用户C、E;通过2步传递间接信任用户F;通过3步传递间接信任用户G。对于可以经过多条路径传递的信任关系,采取最短的路径:例如用户A到用户C可以通过A-B-C,也可以通过A-D-E-C,根据最短路径原则,采取A-B-C,即1步传递。Figure 1 is a description of the trust transfer theory of the present invention, each node represents a user, and the arrow represents a direct trust relationship, for example, user A directly trusts user B and user D, and user B directly trusts user C. According to the theory of trust transmission, user A indirectly trusts users C and E through 1-step transmission; indirectly trusts user F through 2-step transmission; and indirectly trusts user G through 3-step transmission. For trust relationships that can be transmitted through multiple paths, the shortest path is adopted: for example, user A to user C can pass through A-B-C or A-D-E-C. According to the principle of the shortest path, A-B-C is adopted, that is, one-step transmission.
并且在信任传递的基础上加上信任衰减,假设初始直接信任值为t,信任衰减参数为θ,则通过1步传递的间接信任值为t*θ,通过2步传递的间接信任值为t*θ*θ,以此类推。理论上传递2步到3步为最佳。And trust decay is added on the basis of trust transfer, assuming that the initial direct trust value is t, and the trust decay parameter is θ, then the indirect trust value transferred through 1 step is t*θ, and the indirect trust value transferred through 2 steps is t *θ*θ, and so on. In theory, passing 2 steps to 3 steps is the best.
图2为基于信任关系的推荐系统的流程图。其推荐方法包括如下步骤:Fig. 2 is a flowchart of a recommendation system based on trust relationship. The recommended method includes the following steps:
步骤1,推荐系统启动;Step 1, the recommendation system starts;
步骤2,确定被推荐用户;Step 2, determine the recommended user;
步骤3,判断被推荐用户是否存在历史记录(例如已购买物品、对物品评分等),如果存在,进入步骤4;如果不存在,即为新用户,则进入步骤6;Step 3, determine whether the recommended user has historical records (such as purchased items, rating items, etc.), if yes, go to step 4; if not, it is a new user, then go to step 6;
步骤4,导入用户-物品评分矩阵(一种用户历史记录的表现形式);Step 4, import user-item rating matrix (a form of representation of user history);
步骤5,根据步骤4已导入的信息计算被推荐用户与系统内其他用户的相似度(可以采用Pearson相似度);Step 5, calculate the similarity between the recommended user and other users in the system according to the information imported in step 4 (Pearson similarity can be used);
步骤6,导入用户-用户信任矩阵(一种用户与用户之间的关系的表现形式),对于旧用户来说,是系统内旧用户与旧用户之间的信任关系;对于新用户来说,是整合的其他平台上的新用户与旧用户之间的信任关系;Step 6, import the user-user trust matrix (a representation of the relationship between users), for old users, it is the trust relationship between old users and old users in the system; for new users, It is the trust relationship between new users and old users on other integrated platforms;
步骤7,对步骤6导入的信任关系按照上文提出的信任传递理论进行信任传递,并将结果保存在信任关系中;Step 7, perform trust transfer on the trust relationship imported in step 6 according to the trust transfer theory proposed above, and save the result in the trust relationship;
步骤8,计算被推荐用户对系统内其他用户的信任值(包含直接信任与间接信任);Step 8, calculate the trust value (including direct trust and indirect trust) of the recommended user to other users in the system;
步骤9,整合步骤5计算出来的相似度和步骤8计算出来的信任值,综合得出被推荐用户与系统内其他用户的关联度;如果被推荐用户不存在历史记录,则单独采取步骤8的信任值计算被推荐用户与系统内其他用户的关联度;Step 9: Integrate the similarity calculated in step 5 and the trust value calculated in step 8 to obtain the degree of association between the recommended user and other users in the system; if the recommended user does not have a history record, take step 8 alone The trust value calculates the degree of association between the recommended user and other users in the system;
步骤10,根据步骤9计算出来的关联度,得出被推荐用户的邻近用户topMatches(即与被推荐用户关联度最大的N个用户);Step 10, according to the degree of association calculated in step 9, the adjacent user topMatches of the recommended user is obtained (ie, the N users with the highest degree of association with the recommended user);
步骤11,根据步骤10的邻近用户topMatches,利用协同过滤算法计算用户对物品的“预测评分”;Step 11, according to the adjacent user topMatches in step 10, use the collaborative filtering algorithm to calculate the user's "predictive score" for the item;
步骤12,将物品按“预测评分值”由高到低排列;Step 12, arrange the items according to the "predicted score value" from high to low;
步骤13,将前N个物品作为推荐物品;Step 13, using the first N items as recommended items;
步骤14,推荐结束。Step 14, end of recommendation.
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,尽管参照前述实施例对本发明进行了详细的说明,对于本领域的技术人员来说,其依然可以对前述各实施例所记载的技术方案进行修改,或者对其中部分技术特征进行等同替换。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still understand the foregoing embodiments The recorded technical solutions are modified, or some of the technical features are equivalently replaced. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.
Claims (2)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title | 
|---|---|---|---|
| CN201510272410.6A CN104915391A (en) | 2015-05-25 | 2015-05-25 | Article recommendation method based on trust relationship | 
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title | 
|---|---|---|---|
| CN201510272410.6A CN104915391A (en) | 2015-05-25 | 2015-05-25 | Article recommendation method based on trust relationship | 
Publications (1)
| Publication Number | Publication Date | 
|---|---|
| CN104915391A true CN104915391A (en) | 2015-09-16 | 
Family
ID=54084454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date | 
|---|---|---|---|
| CN201510272410.6A Pending CN104915391A (en) | 2015-05-25 | 2015-05-25 | Article recommendation method based on trust relationship | 
Country Status (1)
| Country | Link | 
|---|---|
| CN (1) | CN104915391A (en) | 
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title | 
|---|---|---|---|---|
| CN105574430A (en) * | 2015-12-02 | 2016-05-11 | 西安邮电大学 | Novel privacy protection method in collaborative filtering recommendation system | 
| CN108038217A (en) * | 2017-12-22 | 2018-05-15 | 北京小度信息科技有限公司 | Information recommendation method and device | 
| CN109101667A (en) * | 2018-09-29 | 2018-12-28 | 新乡学院 | A kind of personalized recommendation method based on explicit trust and implicit trust | 
| CN109690608A (en) * | 2016-02-29 | 2019-04-26 | Www.信任科学.Com股份有限公司 | Extrapolating trends in confidence scores | 
| CN111159570A (en) * | 2019-12-16 | 2020-05-15 | 聚好看科技股份有限公司 | Information recommendation method and server | 
| US12299689B1 (en) | 2010-01-14 | 2025-05-13 | Www.Trustscience.Com Inc. | Cluster of mobile devices performing parallel computation of network connectivity | 
| US12339876B2 (en) | 2016-02-17 | 2025-06-24 | Www.Trustscience.Com Inc. | Searching for entities based on trust score and geography | 
| US12346979B2 (en) | 2015-03-20 | 2025-07-01 | Www.Trustscience.Com Inc. | Calculating a trust score | 
| US12373452B2 (en) | 2017-03-22 | 2025-07-29 | Www.Trustscience.Com Inc. | Identity resolution in big, noisy, and/or unstructured data | 
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title | 
|---|---|---|---|---|
| US20100169328A1 (en) * | 2008-12-31 | 2010-07-01 | Strands, Inc. | Systems and methods for making recommendations using model-based collaborative filtering with user communities and items collections | 
| CN102609523A (en) * | 2012-02-10 | 2012-07-25 | 上海视畅信息科技有限公司 | Collaborative filtering recommendation algorithm based on article sorting and user sorting | 
| CN102779182A (en) * | 2012-07-02 | 2012-11-14 | 吉林大学 | Collaborative filtering recommendation method for integrating preference relationship and trust relationship | 
- 
        2015
        
- 2015-05-25 CN CN201510272410.6A patent/CN104915391A/en active Pending
 
 
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title | 
|---|---|---|---|---|
| US20100169328A1 (en) * | 2008-12-31 | 2010-07-01 | Strands, Inc. | Systems and methods for making recommendations using model-based collaborative filtering with user communities and items collections | 
| CN102609523A (en) * | 2012-02-10 | 2012-07-25 | 上海视畅信息科技有限公司 | Collaborative filtering recommendation algorithm based on article sorting and user sorting | 
| CN102779182A (en) * | 2012-07-02 | 2012-11-14 | 吉林大学 | Collaborative filtering recommendation method for integrating preference relationship and trust relationship | 
Non-Patent Citations (1)
| Title | 
|---|
| 徐小伟: ""基于信任的协同过滤推荐算法在电子商务推荐系统的应用研究"", 《中国优秀硕士学位论文全文数据库 (电子期刊),信息科技辑》 * | 
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title | 
|---|---|---|---|---|
| US12299689B1 (en) | 2010-01-14 | 2025-05-13 | Www.Trustscience.Com Inc. | Cluster of mobile devices performing parallel computation of network connectivity | 
| US12346979B2 (en) | 2015-03-20 | 2025-07-01 | Www.Trustscience.Com Inc. | Calculating a trust score | 
| CN105574430B (en) * | 2015-12-02 | 2018-04-06 | 西安邮电大学 | A kind of new method for secret protection in Collaborative Filtering Recommendation System | 
| CN105574430A (en) * | 2015-12-02 | 2016-05-11 | 西安邮电大学 | Novel privacy protection method in collaborative filtering recommendation system | 
| US12339876B2 (en) | 2016-02-17 | 2025-06-24 | Www.Trustscience.Com Inc. | Searching for entities based on trust score and geography | 
| CN109690608A (en) * | 2016-02-29 | 2019-04-26 | Www.信任科学.Com股份有限公司 | Extrapolating trends in confidence scores | 
| CN109690608B (en) * | 2016-02-29 | 2023-06-20 | Www.信任科学.Com股份有限公司 | Extrapolating trends in trust scores | 
| US12373452B2 (en) | 2017-03-22 | 2025-07-29 | Www.Trustscience.Com Inc. | Identity resolution in big, noisy, and/or unstructured data | 
| CN108038217A (en) * | 2017-12-22 | 2018-05-15 | 北京小度信息科技有限公司 | Information recommendation method and device | 
| CN108038217B (en) * | 2017-12-22 | 2021-05-11 | 北京星选科技有限公司 | Information recommendation method and device | 
| CN109101667A (en) * | 2018-09-29 | 2018-12-28 | 新乡学院 | A kind of personalized recommendation method based on explicit trust and implicit trust | 
| CN109101667B (en) * | 2018-09-29 | 2021-07-09 | 新乡学院 | A personalized recommendation method based on explicit trust and implicit trust | 
| CN111159570B (en) * | 2019-12-16 | 2023-10-24 | 聚好看科技股份有限公司 | Information recommendation method and server | 
| CN111159570A (en) * | 2019-12-16 | 2020-05-15 | 聚好看科技股份有限公司 | Information recommendation method and server | 
Similar Documents
| Publication | Publication Date | Title | 
|---|---|---|
| CN104915391A (en) | Article recommendation method based on trust relationship | |
| CN104317835B (en) | The new user of video terminal recommends method | |
| CN104462560B (en) | A kind of recommendation method of personalized recommendation system | |
| CN102609533B (en) | Kernel method-based collaborative filtering recommendation system and method | |
| CN106484876A (en) | A kind of based on typical degree and the collaborative filtering recommending method of trust network | |
| Chen et al. | Improving music recommendation by incorporating social influence | |
| CN102073717A (en) | Home page recommending method for orienting vertical e-commerce website | |
| CN109710835B (en) | A Recommendation Method for Heterogeneous Information Networks with Time Weights | |
| Liu et al. | Towards a dynamic top-n recommendation framework | |
| Stanescu et al. | A hybrid recommender system: User profiling from keywords and ratings | |
| CN110334284A (en) | A Novel Recommendation Method Fused with Multi-factor Decision-Making | |
| Li et al. | Social recommendation based on trust and influence in SNS environments | |
| CN110069713A (en) | A kind of personalized recommendation method based on user's context perception | |
| Sun | Music individualization recommendation system based on big data analysis | |
| CN104111959B (en) | Service recommendation method based on social networks | |
| Wang et al. | Research on BP neural network recommendation model fusing user reviews and ratings | |
| Zhang | Intelligent recommendation model of contemporary pop music based on knowledge map | |
| Chen et al. | Leveraging heterogeneous information based on heterogeneous network and homophily theory for community recommendations | |
| Zhang et al. | A Survey on Side Information-driven Session-based Recommendation: From a Data-centric Perspective | |
| Aggarwal | Social and trust-centric recommender systems | |
| Zhao et al. | An improved user identification method across social networks via tagging behaviors | |
| CN107798045A (en) | User towards middle-size and small-size website, which accesses, is intended to acquisition methods and system | |
| Wan et al. | A recommendation approach based on heterogeneous network and dynamic knowledge graph | |
| Zaman et al. | Cross domain recommendation using dual inductive transfer learning | |
| He et al. | An empirical study on user-topic rating based collaborative filtering methods | 
Legal Events
| Date | Code | Title | Description | 
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | 
             Application publication date: 20150916  | 
        |
| RJ01 | Rejection of invention patent application after publication |