Multi-relational reinforcement for computing credibility of nodes

Nowadays, growing number of social networks are available on the internet, with which users can conveniently make friends, share information, and exchange ideas with each other. As the result, large amount of data are generated from activities of those users. Such data are regarded as valuable resources to support different mining tasks, such as predicting friends for a user, ranking users in terms of their influence on the social network, or identifying communities with common interests. Traditional algorithms for those tasks are often designed under the assumption that a user selects another user as his friend based on their common interests. As a matter of fact, users on a social network may not always develop their friends with common interest. For example, a user may randomly select other users as his friends just in order to attract more links reversely from them. Therefore, such links may not indicate his influence. In this paper, we study the user rank problem in terms of their ‘real’ influences. For this sake, common interest relationships among users are established besides their friend relationships. Then, the credible trust link from one node to another is on account of their similarities, which means the more similar the two users, the more credible their trust relation. So the credibility of a node is high if its trust inlinks are credible enough. In this work, we propose a framework that computes the credibility of nodes on a multi-relational network using reinforcement techniques. To the best of our knowledge, this is the first work to assess credibility exploited knowledge on multi-relational social networks. The experimental results on real data sets show that our framework is effective.