{'fraction_non_alphanumeric': 0.011795543905635648, 'fraction_numerical': 0.0, 'mean_word_length': 5.161290322580645, '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}}
Approximate query processing for efficient content-based image retrieval based on a hierarchical SOM

In this paper, we propose a new approach for similarity matching in image retrieval based on approximate query processing in a hierarchical SOM. We first map the high dimensional input vectors to a low dimensional grid by a local membership function which preserves the relationships between the input vectors and their neighboring weight vectors. Then, we use a hierarchical tree to reduce the computation cost for finding the best match unit. Finally, we retrieve the k nearest neighbors of the query vector by an approximate query processing approach. The experiments show that the proposed approach works well on both synthetic datasets and image databases.