{'fraction_non_alphanumeric': 0.019300361881785282, 'fraction_numerical': 0.0, 'mean_word_length': 5.747967479674797, '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}}
Composite Sketch Shape Recognition Based on Dagsvm and Decision Tree

Sketch recognition provides the basis for semantic processing in sketching understanding, and it consists of two sequential and cyclic phases: primitive shape recognition and composite shape recognition. In this paper, a composite shape recognition algorithm based on support vector machines (SVM) and decision tree is proposed. Directed acyclic graphs SVM (DAGSVM) is used for primitive shape recognition and composite shape recognition. The decision tree is introduced to pre-classify the composite shape and to reduce the computational cost of recognition. The algorithm integrates the advantages of feature-based and similarity-based recognition approaches, and can deal with sketching sequence properly. Experiment demonstrates that the model is feasible