{'fraction_non_alphanumeric': 0.009656652360515022, 'fraction_numerical': 0.0, 'mean_word_length': 5.570422535211268, '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}}
Learning Feature Weights for Similarity Measures

When employing a similarity function to measure the similarity between two cases, one large problem is how to determine the feature weights. This paper presents a new method for learning feature weights in a similarity function from the given similarity information. The similarity information can be divided into two kinds: One is called qualitative similarity information which represents the similarities between cases. The other is called relative similarity information which represents the relation between similarities of two case pairs both including a same case. We apply genetic algorithms to learn feature weights from these two kinds of information respectively. The proposed genetic algorithms are applicable to both linear and nonlinear similarity functions. Our experiments show the learning results are better even if the given similarity information include errors.