{'fraction_non_alphanumeric': 0.018288222384784197, 'fraction_numerical': 0.0, 'mean_word_length': 5.422535211267606, '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}}
Harmony search based on improved partial opposition-based learning

A great deal of researchers has concentrated on creating powerful systems for bundle questions, and a ton of magnificent methodologies have been proposed. Shockingly, the vast majority of the current strategies center around a little volume of information. The fast increment in information volume implies that customary techniques for bundle inquiries think that it’s hard to meet the expanding prerequisites. To take care of this issue, a novel advancement strategy for bundle inquiries (HPPQ) is proposed in this paper. In the first place, the information is preprocessed into locales. Information preprocessing portions the dataset into numerous subsets and the centroid of the subsets is utilized for bundle questions, this adequately diminishes the volume of hopeful outcomes. Besides, a proficient heuristic calculation is proposed (in particular IPOL-HS) in view of the preprocessing results. This enhances the nature of the applicant results in the iterative stage and enhances the intermingling rate of the heuristic calculation. At last, a system called HPR is proposed, which depends on an eager calculation and parallel handling to quicken the rate of inquiry. The test results demonstrate that our technique can essentially decrease time utilization contrasted and existing strategies.