{'fraction_non_alphanumeric': 0.013636363636363636, 'fraction_numerical': 0.0, 'mean_word_length': 5.12037037037037, '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}}
Mining association rules with composite items

Association rules can be used to express relationships between items of data. The process of mining associations rules is to analysis the data in a database to discover "interesting" rules. Existing algorithms for mining association rules require that a record in the database contain all the data items in a rule. This requirement makes it difficult to discover certain useful rules in some applications. To solve the problem, this paper describes an algorithm for mining association rules with composite items. The algorithm has the potential to discover rules which cannot be discovered by existing algorithms.