{'fraction_non_alphanumeric': 0.02243829468960359, 'fraction_numerical': 0.0, 'mean_word_length': 5.371428571428571, '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}}
Research on the performance of relevance vector machine for regression and classification

In order to overcome many inherent defects of support vector machine (SVM), for example, the kernel function must satisfy the Mercer condition, relevance vector machine (RVM) was proposed to avoid these shortcomings of SVM. This study concerns with the performance of RVM and SVM for regression and classification problem. Because RVM is based on Bayesian framework, a priori knowledge of the penalty term is introduced, the RVM needless relevance vectors (RVs) (support vectors (SVs) in SVM) but better generalization ability than SVM. In this paper, Sparse Bayesian learning (SBL) is firstly introduced and then RVM regression and classification models which based on SBL are introduced secondly, and then by inference the parameters, the RVM learning is transform into maximize the marginal likelihood function estimation, and give three kinds of commonly used estimation methods. Finally, we do some simulation experiments to show that the RVM has less RVs or SVs but better generalization ability than SVM whether regression or classification case, and also show that different kernel functions will impact the performance of RVM. However, there does not exist the performance of a kernel function is much better than other kernel functions.