{'fraction_non_alphanumeric': 0.02689075630252101, 'fraction_numerical': 0.0, 'mean_word_length': 5.139175257731959, '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}}
Semi-Supervised Partial Multi-Label Learning

Partial multi-label learning (PML) deals with problems where each instance is associated with a candidate label set, which contains multiple relevant labels and some noisy labels. In many real-world scenarios, it is impractical to annotate all examples for a huge-size dataset. Instead, a more common case is that only a small set of the data are annotated with partial labels, while most data are unlabeled. In this paper, we formalize such problems as a new learning framework called Semi-Supervised Partial Multi-label Learning (SSPML). To solve the SSPML problem, a latent label variable is introduced for each example as the low-dimensional embedding of the feature space. On one hand, label variables are recovered by encouraging consistent similarity measurement between the feature space and the label space; on the other hand, the similarities are adaptively updated based on the feedback from the label space. Meanwhile, the multi-label classifier is jointly trained under the supervision of label variables. Extensive experiments on multiple datasets from various real-world tasks validate the effectiveness of the proposed approach.