{'fraction_non_alphanumeric': 0.04079861111111111, 'fraction_numerical': 0.001736111111111111, 'mean_word_length': 5.068421052631579, '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}}
SemStim: Exploiting Knowledge Graphs for Cross-Domain Recommendation

In this paper we introduce SemStim, an unsupervised graph-based algorithm that addresses the cross-domain recommendation task. In this task, preferences from one conceptual domain (e.g. movies) are used to recommend items belonging to another domain (e.g. music). SemStim exploits the semantic links found in a knowledge graph (e.g. DBpedia), to connect domains and thus generate recommendations. As a key benefit, our algorithm does not require (1) ratings in the target domain, thus mitigating the cold-start problem and (2) overlap between users or items from the source and target domains. In contrast, current state-of-the-art personalisation approaches either have an inherent limitation to one domain or require rating data in the source and target domains. We evaluate SemStim by comparing its accuracy to state-of-the-art algorithms for the top-k recommendation task, for both single-domain and cross-domain recommendations. We show that SemStim enables cross-domain recommendation, and that in addition, it has a significantly better accuracy than the baseline algorithms.