A Visualization Algorithm of Indez Hierarchical Structure
This studys 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 studys 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.
Indez hierarchical structure tree Mid-point of the memory function Cycle to determine Time complezity 300 stocks of Shanghai and Shenzhen
Feixue Huang Xiaoli Sun Zhijie Li
Department of Economics Dalian University of Technology Dalian,Liaoning Province,China,116024 School of Computer Science & Engineering Dalian University of Technology Dalian,Liaoning Province,Ch School of Computer Science & Engineering Dalian Nationalities University Dalian,Liaoning Province,Ch
国际会议
上海
英文
2631-2634
2009-11-20（万方平台首次上网日期，不代表论文的发表时间）