{'fraction_non_alphanumeric': 0.012560386473429951, 'fraction_numerical': 0.0, 'mean_word_length': 6.095890410958904, '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}}
Robust and graph regularised non-negative matrix factorisation for heterogeneous co-transfer clustering

Transferring learning is proposed to tackle the problem where target instances are scarce to train an accurate model. Most existing transferring learning algorithms are designed for supervised learning and cannot obtain transferring results on multiple heterogeneous domains simultaneously. Moreover, the performance of transfer learning can be seriously degraded with the appearance of noises and corruptions. In this paper, a robust non-negative collective matrix factorisation model is proposed for heterogeneous co-transfer clustering which introduces the error matrices to capture the sparsely distributed noises. The heterogeneous clustering tasks are handled simultaneously and the graph regularisation is enforced on the collective matrix factorisation model to keep the intrinsic geometric structure of different domains. Experiment results on the real-world dataset show the proposed algorithm outperforms the baselines.