关键词: 信任关系, 最大流, 二分图

Abstract: To obtain information quickly and accurately from Internet is very important. Recommendation according to trust relationship between users is a very effective method to get information rapidly, however trust relationship is usually very sparse, it is hard to achieve appropriate trust relationship, which influences the recommendation results. This paper proposes a method which converts the process of extending trust relationship into the problem of maximum flow match of trust, and calculates the trust relationship based on the maximum flow between users. The experimental results in Epinions dataset show that the method for finding trust relationship based on maximum flow is more accurate than the probability-based matrix decomposition, social recommendation, trust and distrust-based recommendation methods.

Key words: trust relationship, maximum flow, bipartite graph