{'fraction_non_alphanumeric': 0.02236198462613557, 'fraction_numerical': 0.0, 'mean_word_length': 5.62962962962963, '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}}
Artificial bee colony algorithm for content‐based image retrieval

Image retrieval is the process of searching for digital images from a large database. There exist two distinctive research groups, which employ the content‐based and description‐based approaches, respectively. However, research in the content‐based domain is currently dominant in the field, while the other approaches are not as widely utilized. Although there are a number of different techniques that are available for image retrieval, the development of more effective methods is still necessary. In recent years, previous research has shown that biologically inspired metaheuristic algorithms have great potential for use in solving problems in many science and engineering domains. The artificial bee colony (ABC) algorithm is one of the more promising biologically inspired metaheuristic approaches used to find optimal solutions as it has the advantages of convenient implementation and efficient performance. In this article, a new efficient method based on a combination of the gray‐level cooccurrence matrix (GLCM) with the ABC, referred to as “GLCM‐ABC,” is proposed for use in content‐based image retrieval (CBIR). The experimental results demonstrate that the proposed approach works well for CBIR and can classify specific types of material surfaces in images with a reasonably high level of accuracy as well as outperform other existing algorithms.