{'fraction_non_alphanumeric': 0.012773722627737226, 'fraction_numerical': 0.0036496350364963502, 'mean_word_length': 5.608433734939759, '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 nonlinear dimensionality reduction with pairwise constraints

The problem of semi-supervised dimensionality reduction with kernels called KS2DR is considered for semi-supervised learning. In this setting, domain knowledge in the form of pair constraints is adopted to specify whether pairs of instances belong to the same class or not. KS2DR can project the samples data onto a set of ‘useful’ features and preserve the structure of unlabeled samples data as well as both similar and dissimilar constraints defined in the feature space, under which the samples with different class labels are easier to be effectively partitioned from each other. We demonstrate the practical usefulness and high scalability of KS2DR algorithms in data visualization and classification tasks through extensive simulation studies. Experimental results show the proposed methods can almost always achieve the highest accuracy when the dimension is reduced. And KS2DR methods outperform some established dimensionality reduction methods no matter how many numbers of constraints, dimensions are used.