{'fraction_non_alphanumeric': 0.028901734104046242, 'fraction_numerical': 0.0072254335260115606, 'mean_word_length': 5.4766355140186915, '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}}
A categorizing associative memory using sparse coding and an adaptive classifier

This paper presents a neural network which stores and retrieves sparse codings categorically, the codings being random realizations of a sequence of biased (0,1) Bernoulli trials. The neural network, denoted by the categorizing associative memory (CAM), consists of two essential functional modules: (1) an adaptive classifier (AC) module which categorizes input data and which bears some resemblance to the ART2a model, and (2) an associative memory module which stores a number of input patterns in each category according to the Hebbian rule, after the AC-module has stabilized its learning of the category.