{'fraction_non_alphanumeric': 0.016706443914081145, 'fraction_numerical': 0.0, 'mean_word_length': 5.2611940298507465, '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': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Data mapping by Restricted Boltzmann Machines for social circles detection

Social circles detection is a special case of community detection in social network that is currently attracting a growing interest in the research community. In this paper, we propose a two-step technique, making emphasis on the mapping of the data by Restricted Boltzmann Machines (RBMs). Social circles are subsequently inferred by k-means over the preprocessed data. We define different vectorial representations from both structural egonet information and user profile features, and perform a set of tests to adjust the optimal parameters of the RBMs. We study and compare the performance on the ego-Facebook dataset of social circles from Facebook from the Stanford Large Network Dataset Collection. We compare our results with several different baselines.