{'fraction_non_alphanumeric': 0.01937984496124031, 'fraction_numerical': 0.0, 'mean_word_length': 4.902857142857143, '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}}
An Improved Greedy Search Algorithm of Bayesian Network Structures for Facial Action Units Recognition

Bayesian Networks (BN) are an effective method to recognize facial action units (AUs) combinations, which is a key issue of AUs recognition. Learning BN structures from data is NP-hard. Greedy search algorithm is a practical approach to learn BN from data, but it is liable to get stuck at a local maximum. In this paper, an improved greedy search algorithm is proposed in order to deal with the above-mentioned problem. The proposed algorithm starts from a prior structure, which is constructed by prior knowledge and simply statistics of AUs database, then updates the prior BN structure not only with the BN structure that has maximum score among all of the nearest neighbors of the prior BN structure, but also updates it with some BN structures that have higher score. The experiments show that the proposed algorithm is computationally simple, easy to implement, and may effectively avoid getting stuck at a local maximum.