{'fraction_non_alphanumeric': 0.01446480231436837, 'fraction_numerical': 0.0, 'mean_word_length': 5.569620253164557, '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}}
A collaborative filtering framework based on local and global similarities with similarity tie-breaking criteria

Collaborative Filtering is the most commonly used technique in Recommender Systems, based on the users ratings in order to identify similar profiles and suggest them items. However, because it depends essentially on direct similarity measures between users or items, it usually suffers from the sparsity problem. Upon this situation, a good alternative is using global similarities to enrich the users neighborhood by transitively connecting them together, even when they do not share any common ratings. In this paper, we investigated the use of both local and global similarity measures with the maximin distance algorithm, along with tie-breaking criteria for neighbors with equal similarity. Our experiments showed that the maximin distance algorithm in fact produces many equally similar global neighbors, and that the criteria set for deciding between them severely improved the results of the recommendation process.