{'fraction_non_alphanumeric': 0.012618296529968454, 'fraction_numerical': 0.0, 'mean_word_length': 5.9489051094890515, '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}}
Optimizing kernel function with applications to kernel principal analysis and locality preserving projection for feature extraction

Kernel learning is a popular research topic in pattern recognition and machine learning. Kernel selection is a crucial problem endured by kernel learning method in the practical applications. Many methods of finding the optimal parameters have been presented, but this kind of methods have no ability of changing the kernel structure, accordingly without changing the data distribution in kernel mapping space. In this paper, we present a uniform framework of kernel optimization based on data-dependent kernel from theory to applications to kernel principal analysis and locality preserving projection for feature extraction. Some experiments are implemented to evaluate the performance and feasibility of this framework. Feature extraction, machine learning, kernel principal analysis, locality preserving projection