{'fraction_non_alphanumeric': 0.013440860215053764, 'fraction_numerical': 0.002688172043010753, 'mean_word_length': 5.056910569105691, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An efficient alternative to personalized page rank for friend recommendations

In this paper, a new algorithm is proposed to calculate the value of friend score in a graph. The main goal is decreasing the running time and accuracy of calculation. Even though similar estimations have been done, the proposed method is faster because it increases the speed of computation with ignoring calculation of not involved nodes. This feature makes this method an acceptable candidate for large networks analyses like search engines and social media friend recommendation techniques. Based on the experiments done in this study, the FOF algorithm increases the speed of calculation by a factor of 28 on the two test datasets, namely, Amazon and Facebook.