Revisiting Local Walking Based on Social Network Trust (LWSNT): Friends Recommendation Algorithm in Facebook Social Networks
Keywords:data science, web mining
In the last decades, the internet penetration rate and online social network users have grown very fast. Online social network, such as Facebook, is a platform where one can find friends without having to meet face to face. A social network is represented by a large graph because it involves many participants. Hence, it is hard to find potential friends who have the same thoughts and interests. The Local Walking Based on Social Network Trust (LWSNT) algorithm is one of the popular algorithms for social friend recommendation. This study re-examines whether the correlation between attributes gives un-match ranks in different cases (cases with and without correlation). We assess the performance of LWSNT in Facebook networks under the supervised manner by comparing its F-score against similar methods. By using Kendall’s tau correlation, the results show that the correlation of attributes has no significant effect on the order of friend recommendations. In addition, the LWSNT performance is quite inferior against the Common Neighbors algorithm and Jaccard index.