【24h】

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.
机译:本研究的目标是解决索引的分层结构的可视化问题。该问题被制定为确定存储器功能的中点并构建循环模块。通过增量表达方式分析可视化算法的时间复杂性。通过使用MATLAB在上海和深圳300指数中绘制样品股指数的层次结构,跨越2005年下半年至2007年下半年,结果表明,该算法可以实现准确,审美和实用要求。这项研究的结论表明,可以有效地应用可视化算法以绘制索引树的分层结构,并且对于某些应用程序字段是一个有趣的选项。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号