Discovering compatible users in social networks Online publication date: Thu, 11-Jun-2015
by Arefeh Kazemi; Mohammad Ali Nematbakhsh; Mohammad Mehdi Keikha
International Journal of Social Network Mining (IJSNM), Vol. 2, No. 1, 2015
Abstract: One of the most significant features of social networks is the connections made between new compatible individuals. Quite a few research projects have been done on making such connections more convenient and possible. Almost all of these systems interpret compatibility as similarity and consider only exact-matching of users' interests. This research proposes a different approach for finding 'new' compatible friends through social networks. We have proposed three new relations among users' interests. These are, firstly semantic similarity, secondly conceptual complement, and thirdly associative complement. We have used the first two relations in the current system and the third relation is left for future works. We chose 50 members of the LiveJournal and calculated the degree of compatibility between each pair. The results showing an average error of 0.21 which is acceptable in comparison with the previous exact-matching systems. In the latter, the average rate of error was 0.54.
Online publication date: Thu, 11-Jun-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Social Network Mining (IJSNM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com