期刊文献+

一个大规模股市图交互式可视化分析系统

On Interactive Visualization for Large-Scale Stock Market Graphs
在线阅读 下载PDF
导出
摘要 随着物联网、移动互联网、云计算以及各种数据自动采集技术的迅猛发展,许多领域迅速积累了大量具有图结构的可用数据。其中一个重要的图应用是股市图。如何分析股市图达到合理充分的投资决策支持一直是一个重要的课题。其中极大团(Maximal Clique)分析是分析股市图的一个重要方法。股市图的规模庞大,传统的极大团枚举算法仅仅罗列图中所有的极大团。但一个图中可以有指数级数量的极大团,而一支股票对应的点可以参与到任意多的极大团中。因此,传统的极大团枚举算法不能直接有效支持股市图分析。本文提出一个支持快速选择、自动分组及导航浏览三种股市图交互式可视化操作的大规模股市图分析系统。根据用户感兴趣的股市图节点,这三种股市图交互式可视化操作从股市图中快速枚举出与这些特定股票相关的极大团、查看这些特定股票之间的组合关系以及显示与这些特定股票相关的其他股票,是有效支持股市图分析的必要手段。同时基于对某些特定顶点或边相关的极大团枚举的需求,本文提出了从图中枚举出与特定顶点或边相关的极大团算法。我们使用真实数据验证了本文提出的算法的优越性。 Maximal clique analysis is an important method of stock market graph analysis. Traditional maximal clique enumeration algorithms enumerate all maximal cliques in the graph, which cannot support efficient stock market graph analysis. In this paper, we propose interactive visualization methods for large-scale stock market graphs. According to user’s interested stocks, we provide functions to enumerate all maximal cliques related to those stocks quickly, and to view their combination relations as well as other related stocks. Our interactive visualization methods are very useful to stock market graph analysis. Moreover, traditional maximal clique enumeration algorithms cannot be applied to support those functions. Due to the need of enumerating all maximal cliques related to specific nodes or edges, we propose a new maximal clique enumeration algorithm containing specific nodes or edges. We use real a dataset to verify the superior performance of our algorithm.
出处 《集成技术》 2013年第1期8-15,共8页 Journal of Integration Technology
关键词 股市图 极大团 图算法 图可视化 大规模图 market graph maximal clique graph algorithm graph visualization large-scale graph
  • 相关文献

参考文献10

  • 1Tarjan R E,Trojanowski A E. Finding a maximum independent set[J].Sociaety for Inustrial and Applied Mathematics Journal on Computing,1977,(03):537-546.
  • 2Tutte T W. How to draw a graph[J].Proceedings in London Mathematical Society,1963,(52):743-768.
  • 3Boginski V,Butenko S,Pardalos P M. On structual properties of the market graph[J].Innovation in Financial and Economic Networks,2003.29-45.
  • 4Moon J W,Moser L. On cliques in graphs[J].Israel Journal of Mathematics,1965,(01):23-28.
  • 5Eades P. A heuristic for graph drawing[J].Congressus Numerantium,1984.149-160.
  • 6Byskov J M. Algorithms for k-colouring and finding maximal independent sets[J].Symposium on Discrete Algorithms,2003.456-457.
  • 7Ankerst M,Ester M,H P K. Towards an effective cooperation of the user and the computer for classification[J].Knowledge Deiscovery and Data Mining,2000.179-188.
  • 8Dutot A,Guinand F,Olivier D. GraphStream:a tool for bridging the gap between complex systems and dynamic graphs[J].In Emergent Properties in Natural and Artificial Complex Systems,2007.
  • 9Tsukiyama S,Ide M,Shirakawa I. A New algorithm for generating all the maximal independent sets[J].Sociaety for Inustrial and Applied Mathematics Journal on Computing,1977,(03):505-517.
  • 10汪加才,陈奇,赵杰煜,俞瑞钊.VISMiner:一个交互式可视化数据挖掘原型系统[J].计算机工程,2003,29(1):17-19. 被引量:10

二级参考文献5

  • 1[1]Keim D A. Visual Database Exploration Techniques. Proc. Tutorial Int.Conf. on Knowledge Discovery & Data Mining, Newport Beach, CA,1997
  • 2[2]Ankerst M. Visual Classification:An Interactive Approach to Decision Tree Construction. Proc.5th Int. Conf. On Knowledge Discovery & Data Mining(KDD'99),SanDiego,CA,1999:392-396
  • 3[3]Kohonen T. Self-organizing Maps Springer- verlag. Berlin,1997
  • 4[4]Inselberg A. The Plane with Parallel Coordinates. Special Issue on Computational Geometry, The Visual Computer, 1985, 1:69-97
  • 5[5]Ultsch A, Siemon H P. Kohonen's Self-organizing Feature Maps for Exploratory Data Analysis. In Proc. INNC'90,International Neural Network Conference,Dordrecht,Netherlands, 1990:305-308

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部