The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2013 vol.19)
pp: 927-940
E. R. Gansner , AT&T Labs. Res., Florham Park, NJ, USA
Yifan Hu , AT&T Labs. Res., Florham Park, NJ, USA
S. North , AT&T Labs. Res., Florham Park, NJ, USA
In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial all-pairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because some nodes may be placed too close together, or even share the same position. We propose a solution, called the maxent-stress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a force-augmented stress majorization algorithm that solves the maxent-stress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.
Stress, Layout, Computational modeling, Entropy, Force, Springs, Approximation methods, low-dimensional embedding, Graph drawing, metric embedding
E. R. Gansner, Yifan Hu, S. North, "A Maxent-Stress Model for Graph Layout", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 6, pp. 927-940, June 2013, doi:10.1109/TVCG.2012.299
[1] J. Barnes and P. Hut, "A Hierarchical O(NlogN) Force-Calculation Algorithm," Nature, vol. 324, pp. 446-449, 1986.
[2] G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis, Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
[3] A.L. Berger, V.J.D. Pietra, and S.A.D. Pietra, "A Maximum Entropy Approach to Natural Language Processing," Computational Linguistics, vol. 22, no. 1, pp. 39-71, 1996.
[4] U. Brandes and C. Pich, "Eigensolver Methods for Progressive Multidimensional Scaling of Large Data," Proc. 14th Int'l Symp. Graph Drawing (GD '06), pp. 42-53, 2007.
[5] U. Brandes and C. Pich, "An Experimental Study on Distance Based Graph Drawing," Proc. 16th Int'l. Symp. Graph Drawing (GD '08), pp. 218-229, 2009.
[6] M. Chalmers, "A Linear Iteration Time Layout Algorithm for Visualising High-Dimensional Data," Proc. Seventh Conf. Visualization (VIS '96), pp. 127-131, 1996.
[7] L. Chen and A. Buja, "Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis," J. Am. Statistical Assoc., vol. 104, pp. 209-219, 2009.
[8] J.D. Cohen, "Drawing Graphs to Convey Proximity: An Incremental Arrangement Method," ACM Trans. Computer-Human Interaction, vol. 4, no. 3, pp. 197-229, /, Sept. 1997.
[9] T.A. Davis and Y.F. Hu, "University of Florida Sparse Matrix Collection," ACM Trans. Math. Software, vol. 38, pp. 1-18, 2011.
[10] V. de Silva and J.B. Tenenbaum, "Global versus Local Methods in Nonlinear Dimensionality Reduction," Proc. Advances in Neural Information Processing Systems 15, pp. 721-728, 2003.
[11] P. Eades, "A Heuristic for Graph Drawing," Congressus Numerantium, vol. 42, pp. 149-160, 1984.
[12] P. Eades and X. Lin, "Spring Algorithms and Symmetry," Proc. Int'l Conf. Computing and Combinatorics (COCOON), pp. 202-211, 1997.
[13] T.M.J. Fruchterman and E.M. Reingold, "Graph Drawing by Force Directed Placement," Software - Practice and Experience, vol. 21, pp. 1129-1164, 1991.
[14] P. Gajer, M.T. Goodrich, and S.G. Kobourov, "A Fast Multi-Dimensional Algorithm for Drawing Large Graphs," vol. 1984, pp. 211-221, 2000.
[15] E.R. Gansner, Y. Koren, and S.C. North, "Graph Drawing by Stress Majorization," Proc. 12th Int'l. Symp. Graph Drawing (GD '04), pp. 239-250, 2004.
[16] E.R. Gansner and S. North, "An Open Graph Visualization System and Its Applications to Software Engineering," Software - Practice & Experience, vol. 30, pp. 1203-1233, 2000.
[17] S. Hachul and M. Jünger, "Drawing Large Graphs with a Potential Field Based Multilevel Algorithm," Proc. 12th Int'l Symp. Graph Drawing (GD '04), pp. 285-295, 2004.
[18] D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embeddingj," J. Graph Algorithms and Applications, vol. 8, no. 2, pp. 195-214, 2004.
[19] G.E. Hinton and S.T. Roweis, "Stochastic Neighbor Embedding," Proc. Neural Information Processing Systems (NIPS), pp. 833-840, S. Becker, S. Thrun, and K. Obermayer, eds., 2002.
[20] Y.F. Hu, "Efficient and High Quality Force-Directed Graph Drawing," Math. J., vol. 10, pp. 37-71, 2005.
[21] Y.F. Hu and Y. Koren, "Extending the Spring-Electrical Model to Overcome Warping Effects," Proc. IEEE Pacific Visualization Symp., pp. 129-136, 2009.
[22] S. Ingram, T. Munzner, and M. Olano, "Glimmer: Multilevel MDS on the GPU," IEEE Trans. Visualization Computer Graphics, vol. 15, no. 2, pp. 249-261, Mar./Apr. 2009.
[23] E.T. Jaynes, "Information Theory and Statistical Mechanics," Physical Rev. Series II, vol. 106, no. 4, pp. 620-630, 1957.
[24] D.B. Johnson, "Efficient Algorithms for Shortest Paths in Sparse Networks," J. ACM, vol. 24, no. 1, pp. 1-13, Jan. 1977.
[25] T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, pp. 7-15, 1989.
[26] M. Khoury, Y. Hu, S. Krishnan, and C. Scheidegger, "Drawing Large Graphs by Low-Rank Stress Majorization," Proc. Eurographics/IEEE TVCG Symp. Visualization, 2012.
[27] Y. Koren and A. Çivril, "The Binary Stress Model for Graph Drawing," Proc. 16th Int'l Symp. Graph Drawing (GD '08), pp. 193-205, 2008.
[28] J.B. Kruskal, "Multidimensioal Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis," Psychometrika, vol. 29, pp. 1-27, 1964.
[29] J.B. Kruskal and J.B. Seery, "Designing Network Diagrams," Proc. First General Conf. Social Graphics, pp. 22-50, July 1980.
[30] G. Lynn, "Calculus in Architecture," , 2005.
[31] L.v. Maaten and G. Hinton, "Visualizing Data Using t-sne," J. Machine Learning Research, vol. 9, pp. 2579-2605, 2008.
[32] A. Noack, "Energy Models for Graph Clustering," J. Graph Algorithms and Applications, vol. 11, pp. 453-480, 2007.
[33] A. Noack, "Modularity Clustering is Force-Directed Layout," Physical Rev. E (Statistical, Nonlinear, and Soft Matter Physics), vol. 79, 2009.
[34] S. Pettie, "A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs," Theoretical Computer Science, vol. 312, no. 1, pp. 47-74, Jan. 2004.
[35] S.J. Phillips, R.P. Anderson, and R.E. Schapire, "Maximum Entropy Modeling of Species Geographic Distributions," Ecological Modelling, vol. 190, nos. 3/4, pp. 231-259, 2006.
[36] H.C. Purchase, "Which Aesthetic Has the Greatest Effect on Human Understanding?" Proc. Fifth Int'l Symp. Graph Drawing (GD '97), pp. 248-261, 1997.
[37] A. Quigley, "Large Scale Relational Information Visualization, Clustering, and Abstraction," PhD thesis, Dept. of Computer Science and Software Eng., Univ. Newcastle, Australia, 2001.
[38] D. Tunkelang, "A Numerical Optimization Approach to General Graph Drawing," PhD thesis, Carnegie Mellon Univ., 1999.
[39] J. Venna, J. Peltonen, K. Nybo, H. Aidos, and S. Kaski, "Information Retrieval Perspective to Nonlinear Dimensionality Reduction for Data Visualization," J. Machine Learning Research, vol. 11, pp. 451-490, 2010.
[40] C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," J. Graph Algorithms and Applications, vol. 7, pp. 253-285, 2003.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool