{'fraction_non_alphanumeric': 0.014571948998178506, 'fraction_numerical': 0.0, 'mean_word_length': 5.790123456790123, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Extensions to Pairwise Similarity Calculation of Information Networks

We focus on extensions to the pairwise similarity calculation of information networks. By considering both inand out-link relationships, we propose Additiveand Multiplicative-SimRank to calculate the similarity score. Then we discuss the loop/cycles problem of information networks and propose a method to address this problem. Our extensive experimental results conducted on eight food web data sets show that our approach performs significantly better than earlier approaches.