{'fraction_non_alphanumeric': 0.02243211334120425, 'fraction_numerical': 0.0, 'mean_word_length': 5.894308943089431, '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}}
Investigation of KLIM algorithm applied to face recognition

Face recognition often suffers from the small sample size problem. Regularization is one of the solutions to this problem. In this paper, we investigate the Kullback-Leibler information measure (KLIM) based regularization classifiers for face recognition. Two parameter estimation approaches including the cross-validation technique and model selection criterion are chosen to optimize the regularization parameter. In the experiments, the ORL face data is used to evaluate these algorithms. We compared the KLIM algorithms with quadratic discriminant analysis, linear discriminant analysis, regularized discriminant analysis, and leave-one-out covariance matrix estimate. Considering both time cost and classification rate, KLIM classifiers exceed the others and obtain stable results.