Interactive visualization of streaming text data with dynamic maps

Journal of Graph Algorithms and Applications

Volumn 17, Issue 4, 2013, Pages 515-540

  Gansner, Emden R ^a   Hu, Yifan ^a   North, Stephen ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA VISUALIZATION; SEMANTICS; VISUALIZATION;

DYNAMIC GRAPH; DYNAMIC MAPS; GRAPH CLUSTERING; INTERACTIVE VISUALIZATIONS; MAP GENERATION; REAL- TIME; SEMANTIC ANALYSIS; STREAMING TEXTS; TEXT DATA; TEXT STREAMS;

WEB SERVICES;

EID: 84880733196     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00302     Document Type: Article

References (35)

1. C. Albrecht-Buehler, B. Watson, and D. A. Shamma. Visualizing live text streams using motion and temporal pooling. IEEE Computer Graphics and Applications, 25(3):52-59, 2005. doi:10.1109/MCG.2005.70.
2. J. Alsakran, Y. Chen, D. Luo, Y. Zhao, J. Yang, W. Dou, and S. Liu. Realtime visualization of streaming text with a force-based dynamic system. IEEE Computer Graphics and Applications, 32(1):34-45, 2012. doi:10.1109/MCG. 2011.91.
3. D. Archambault and H. C. Purchase. Mental map preservation helps user orientation in dynamic graphs. In W. Didimo and M. Patrignani, editors, Graph Drawing, volume 7704 of Lecture Notes in Computer Science, pages 475-486. Springer, 2012. doi:10.1007/978-3-642-36763-2_42.
4. D. Archambault, H. C. Purchase, and B. Pinaud. Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Transactions on Visualization and Computer Graphics, 17(4):539-552, 2011. doi:10.1109/ TVCG.2010.78.
5. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. The Journal of Machine Learning Research, 3:993-1022, 2003.
6. U. Brandes and S. R. Corman. Visual unrolling of network evolution and the analysis of dynamic discourse. In IEEE INFOVIS'02, pages 145-151, 2002. doi: 10.1109/INFVIS.2002.1173160.
7. U. Brandes and M. Mader. A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In M. J. van Kreveld and B. Speckmann, editors, Graph Drawing, volume 7034 of Lecture Notes in Computer Science, pages 99-110. Springer, 2011. doi:10.1007/978-3-642-25878-7_11.
8. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In G. D. Battista, editor, Graph Drawing, volume 1353 of Lecture Notes in Computer Science, pages 236-247. Springer, 1997. doi:10.1007/ 3-540-63938-1_66.
9. T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Chapman and Hall/CRC, 2000.
10. W. Cui, S. Liu, L. Tan, C. Shi, Y. Song, Z. Gao, H. Qu, and X. Tong. Textflow: Towards better understanding of evolving topics in text. IEEE Trans. Vis. Comput. Graph., 17(12):2412-2421, 2011. doi:10.1109/TVCG.2011.239.
11. W. Cui, Y. Wu, S. Liu, F. Wei, M. X. Zhou, and H. Qu. Context-preserving, dynamic word cloud visualization. IEEE Computer Graphics and Applications, 30:42-53, 2010. doi:10.1109/MCG.2010.102.
12. S. Diehl and C. Görg. Graphs, they are changing. In S. G. Kobourov and M. T. Goodrich, editors, Graph Drawing, volume 2528 of Lecture Notes in Computer Science, pages 23-30. Springer, 2002. doi:10.1007/3-540-36151-0_3.
13. T. Dwyer, K. Marriott, and P. J. Stuckey. Fast node overlap removal. In Proc. 13th Intl. Symp. Graph Drawing (GD '05), volume 3843 of LNCS, pages 153-164. Springer, 2006. doi:10.1007/11618058_15.
14. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. V. Yee. Graphael: Graph animations with evolving layouts. In G. Liotta, editor, Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 98-110. Springer, 2003. doi:10.1007/978-3-540-24595-7_9.
15. S. I. Fabrikant, D. R. Montello, and D. M. Mark. The distance-similarity metaphor in region-display spatializations. IEEE Computer Graphics & Application, 26:34-44, 2006. doi:10.1109/MCG.2006.90.
16. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987. doi:10.1007/BF01840357.
17. K. Freivalds, U. Dogrusöz, and P. Kikusts. Disconnected graph layout and the polyomino packing approach. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing, volume 2265 of Lecture Notes in Computer Science, pages 378-391. Springer, 2001. doi:10.1007/3-540-45848-4_30.
18. E. R. Gansner and Y. Hu. Efficient node overlap removal using a proximity stress model. In I. G. Tollis and M. Patrignani, editors, Graph Drawing, volume 5417 of Lecture Notes in Computer Science, pages 206-217. Springer, 2008. doi: 10.1007/978-3-642-00219-9_20.
19. E. R. Gansner, Y. Hu, and S. C. North. Visualizing streaming text data with dynamic maps. In Proc. 20th Intl. Symp. Graph Drawing (GD '12). Springer, 2012. doi:10.1007/978-3-642-36763-2_39.
20. E. R. Gansner, Y. Koren, and S. C. North. Graph drawing by stress majorization. In Proc. 12th Intl. Symp. Graph Drawing (GD '04), volume 3383 of LNCS, pages 239-250. Springer, 2004. doi:10.1007/978-3-540-31843-9_25.
21. E. R. Gansner and S. North. An open graph visualization system and its applications to software engineering. Software-Practice & Experience, 30:1203-1233, 2000. doi:10.1002/1097-024X(200009)30:111203::AID-SPE3383.0. CO;2-N.
22. E. R. Gansner and S. C. North. Improved force-directed layouts. In Proc. 6th Intl. Symp. Graph Drawing (GD '98), volume 1547 of LNCS, pages 364-373. Springer, 1998. doi:10.1007/3-540-37623-2_28.
23. D. Goehlsdorf, M. Kaufmann, and M. Siebenhaller. Placing connected components of disconnected graphs. In S.-H. Hong and K.-L. Ma, editors, APVIS: 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007, pages 101-108. IEEE, 2007. doi:10.1109/APVIS.2007. 329283.
24. B. Gretarsson, J. O'Donovan, S. Bostandjiev, T. Höllerer, A. U. Asuncion, D. Newman, and P. Smyth. Topicnets: Visual analysis of large text corpora with topic modeling. ACM TIST, 3(2):23, 2012. doi:10.1145/2089094.2089099.
25. I. Herman, G. Melançon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24-43, 2000. doi:10.1109/2945.841119.
26. Y. Hu, E. R. Gansner, and S. Kobourov. Visualizing graphs and clusters as maps. IEEE Computer Graphics and Applications, 30:54-66, 2010. doi:10.1109/ MCG.2010.101.
27. Y. Hu, S. G. Kobourov, and S. Veeramoni. Embedding, clustering and coloring for dynamic maps. In H. Hauser, S. G. Kobourov, and H. Qu, editors, PacificVis, pages 33-40. IEEE, 2012. doi:10.1109/PacificVis.2012.6183571.
28. O. Jin, N. N. Liu, K. Zhao, Y. Yu, and Q. Yang. Transferring topical knowledge from auxiliary long texts for short text clustering. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management, CIKM '11, pages 775-784, New York, NY, USA, 2011. ACM. doi: 10.1145/2063576.2063689.
29. A. Marcus, M. S. Bernstein, O. Badar, D. R. Karger, S. Madden, and R. C. Miller. Twitinfo: aggregating and visualizing microblogs for event exploration. In D. S. Tan, S. Amershi, B. Begole, W. A. Kellogg, and M. Tungare, editors, CHI, pages 227-236. ACM, 2011. doi:10.1145/1978942.1978975.
30. M. E. J. Newman. Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA, 103:8577-8582, 2006. doi:10.1073/pnas.0601602103.
31. H. C. Purchase and A. Samra. Extremes are better: Investigating mental map preservation in dynamic graphs. In G. Stapleton, J. Howse, and J. Lee, editors, Diagrams, volume 5223 of Lecture Notes in Computer Science, pages 60-73. Springer, 2008. doi:10.1007/978-3-540-87730-1_9.
32. J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22:21-74, 2002. doi:10. 1016/S0925-7721(01)00047-5.
33. R. Sibson. Studies in the robustness of multidimensional scaling: Procrustes statistics. Journal of the Royal Statistical Society, Series B (Methodological), 40:234-238, 1978.
34. A. Silic and B. D. Basic. Visualization of text streams: A survey. In R. Setchi, I. Jordanov, R. J. Howlett, and L. C. Jain, editors, KES (2), volume 6277 of Lecture Notes in Computer Science, pages 31-43. Springer, 2010. doi:10.1007/978-3-642-15390-7_4.
35. T. von Landesberger, M. Görner, and T. Schreck. Visual analysis of graphs with multiple connected components. In Proceedings of the IEEE Symposium on Visual Analytics Science and Technology, IEEE VAST 2009, Atlantic City, New Jersey, USA, 11-16 October 2009, pages 155-162, 2009. doi:10.1109/VAST. 2009.5333893.