{'fraction_non_alphanumeric': 0.01141552511415525, 'fraction_numerical': 0.012557077625570776, 'mean_word_length': 5.496296296296296, '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}}
A visualization algorithm of index hierarchical structure

This study's objective is to solve visualization problem of hierarchical structure for the index. The problem is formulated as determining the midpoint of the memory function and constructing the circulation modules. The time complexity of visualization algorithm is analyzed with the way of incremental expression. Through using the MATLAB to draw hierarchical structure of the index of the sample stocks in Shanghai and Shenzhen 300 index, which spans from the second half of 2005 to the second half of 2007, the results show that this algorithm can achieve accurate, aesthetic and practical requirements.This study's conclusion indicates that visualization algorithm may be efficiently applied to drawing the hierarchical structure for the index tree and it is an interesting option for certain application fields.