{'fraction_non_alphanumeric': 0.019243530192435302, 'fraction_numerical': 0.0, 'mean_word_length': 5.362869198312236, '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}}
Sequential Pattern Mining of Large Combinable Items with Values for a Set-of-items Recommendation

Next-item recommendation solutions based on sequential pattern mining have been widely used in empirical studies. However, current solutions do not consider recommendations involving large combinations of items with varied values. For example, inspecting many specimens is key to understanding a patient's current health status and to checking a medical prescription's effectiveness. Typically, a specimen inspection may involve dozens of inspection items selected from more than a thousand possible items, with each item being associated with a measured value. The values themselves will differ for different items. Based on the pattern of previous item values, recommending the next specimen inspection from a huge number of candidate ones, requires that a combination of many inspection items must be processed efficiently. This paper presents a method for vectorizing a combination of items and item values, and identifying clusters of item-set types. From the item-set types that best suit the target input, a set of items is recommended using both frequency and uniqueness. The method was tested experimentally, using real data from a university hospital's electronic medical record system. The results showed that the proposed method can successfully recommend specific item types with the highest precision and recall ratios. The validity of the results was confirmed by the hospital's medical staff.