A Social Trust Path Recommendation System In Social Network Based On Trust

Social network is becoming increasingly popular and being used as the means for a variety. In social network, people always need to expand the circle of friends or recommend some goods and services to others. However, there are too many paths in a social network to connect two unknown participants. So, how to find an optimal path to connect two unknown participants is a very challenging problem.After reading some papers and books related to this area, this paper proposes an algorithm D-MCBA to find the social trust path, based on this algorithm this paper presents a social trust path recommendation system which recommends the optimal social trust path between two participants to users in social network. This recommendation system provides three types of social trust paths, they are the shortest path, the path with the maximal trust value(denoted as Max T) and the multiple constrained K optimal social paths(denoted as top-K Paths). With these three types of trust paths, users can connect with others more effectively. In addition, the system can also represent the basic structure of social network and allows the users to check some basic information of the participants in the social network.This system has many applications in real life like to help an employer find trustworthy loyal employees or to help a retailer to find potential customers.