{'fraction_non_alphanumeric': 0.009700889248181084, 'fraction_numerical': 0.0, 'mean_word_length': 5.620320855614973, '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}}
Misclassification Probability Bounds for Multivariate Gaussian Classes

Classification systems based on linear discriminant analysis are employed in a variety of communications applications, in which the classes are most commonly characterized by known Gaussian PDFs. The performance of these classifiers is analyzed in this paper in terms of the conditional probability of misclassification. Easily computed lower and upper bounds on this error probability are presented and shown to provide corresponding bounds on the number of Monte Carlo trials required to obtain a desired level of accuracy. The error probability bounds yield an exact and easily computed expression for the error probability in the case where there are only two classes and a single hyperplane. In the special case where misclassification into a nominated class is independent of all other misclassifications, successively tighter upper and lower bounds can be computed at the expense of successively higher-order products of the individual misclassification probabilities. Finally, bounds are provided on the number of Monte Carlo trials required to improve, with suitably high confidence level, on the confidence interval formed by the error probability bounds.