메뉴 건너뛰기




Volumn 7704 LNCS, Issue , 2013, Pages 439-450

Visualizing streaming text data with dynamic graphs and maps

Author keywords

[No Author keywords available]

Indexed keywords

ACROSS TIME; DYNAMIC GRAPH; DYNAMIC GRAPH LAYOUT; GRAPH CLUSTERING; MAP GENERATION; ON-LINE SERVICE; PACKING ALGORITHMS; PROCRUSTES; PROJECTION TECHNIQUES; SEMANTIC ANALYSIS; STREAMING TEXTS; TEXT STREAMS; VISUAL STABILITIES;

EID: 84874179419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36763-2_39     Document Type: Conference Paper
Times cited : (23)

References (26)
  • 3
    • 79955680195 scopus 로고    scopus 로고
    • Visual unrolling of network evolution and the analysis of dynamic discourse
    • Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. In: IEEE INFOVIS 2002, pp. 145-151 (2002)
    • (2002) IEEE INFOVIS 2002 , pp. 145-151
    • Brandes, U.1    Corman, S.R.2
  • 4
    • 84455209637 scopus 로고    scopus 로고
    • A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
    • van Kreveld, M.J., Speckmann, B. (eds.) GD 2011. Springer, Heidelberg
    • Brandes, U., Mader, M.: A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing. In: van Kreveld, M.J., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 99-110. Springer, Heidelberg (2012)
    • (2012) LNCS , vol.7034 , pp. 99-110
    • Brandes, U.1    Mader, M.2
  • 5
    • 84957380248 scopus 로고    scopus 로고
    • A Bayesian Paradigm for Dynamic Graph Layout
    • Graph Drawing
    • Brandes, U., Wagner, D.: A Bayesian Paradigm for Dynamic Graph Layout. In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 236-247. Springer, Heidelberg (1997) (Pubitemid 128012909)
    • (1997) LECTURE NOTES in COMPUTER SCIENCE , Issue.1353 , pp. 236-247
    • Brandes, U.1    Wagner, D.2
  • 8
    • 84867485251 scopus 로고    scopus 로고
    • Graphs, They Are Changing - Dynamic Graph Drawing for a Sequence of Graphs
    • Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. Springer, Heidelberg
    • Diehl, S., Görg, C.: Graphs, They Are Changing - Dynamic Graph Drawing for a Sequence of Graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 23-31. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2528 , pp. 23-31
    • Diehl, S.1    Görg, C.2
  • 9
    • 33745650498 scopus 로고    scopus 로고
    • Fast Node Overlap Removal
    • Healy, P., Nikolov, N.S. (eds.) GD 2005. Springer, Heidelberg
    • Dwyer, T., Marriott, K., Stuckey, P.J.: Fast Node Overlap Removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153-164. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3843 , pp. 153-164
    • Dwyer, T.1    Marriott, K.2    Stuckey, P.J.3
  • 12
    • 84867444225 scopus 로고    scopus 로고
    • Disconnected Graph Layout and the Polyomino Packing Approach
    • Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. Springer, Heidelberg
    • Freivalds, K., Dogrusoz, U., Kikusts, P.: Disconnected Graph Layout and the Polyomino Packing Approach. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 378-391. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2265 , pp. 378-391
    • Freivalds, K.1    Dogrusoz, U.2    Kikusts, P.3
  • 13
    • 68749100083 scopus 로고    scopus 로고
    • Efficient Node Overlap Removal Using a Proximity Stress Model
    • Tollis, I.G., Patrignani, M. (eds.) GD 2008. Springer, Heidelberg
    • Gansner, E.R., Hu, Y.: Efficient Node Overlap Removal Using a Proximity Stress Model. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 206-217. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5417 , pp. 206-217
    • Gansner, E.R.1    Hu, Y.2
  • 16
    • 0034274870 scopus 로고    scopus 로고
    • An open graph visualization system and its applications to software engineering
    • Gansner, E.R., North, S.: An open graph visualization system and its applications to software engineering. Software - Practice & Experience 30, 1203-1233 (2000)
    • (2000) Software - Practice & Experience , vol.30 , pp. 1203-1233
    • Gansner, E.R.1    North, S.2
  • 17
    • 84957872763 scopus 로고    scopus 로고
    • Improved Force-Directed Layouts
    • Whitesides, S.H. (ed.) GD 1998. Springer, Heidelberg
    • Gansner, E.R., North, S.C.: Improved Force-Directed Layouts. In:Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 364-373. Springer, Heidelberg (1999)
    • (1999) LNCS , vol.1547 , pp. 364-373
    • Gansner, E.R.1    North, S.C.2
  • 23
    • 79958165921 scopus 로고    scopus 로고
    • Twitinfo: Aggregating and visualizing microblogs for event exploration
    • Tan, D.S., Amershi, S., Begole, B., Kellogg, W.A., Tungare, M. (eds.) ACM
    • Marcus, A., Bernstein, M.S., Badar, O., Karger, D.R., Madden, S., Miller, R.C.: Twitinfo: aggregating and visualizing microblogs for event exploration. In: Tan, D.S., Amershi, S., Begole, B., Kellogg, W.A., Tungare, M. (eds.) CHI, pp. 227-236. ACM (2011)
    • (2011) CHI , pp. 227-236
    • Marcus, A.1    Bernstein, M.S.2    Badar, O.3    Karger, D.R.4    Madden, S.5    Miller, R.C.6
  • 24
    • 33745012299 scopus 로고    scopus 로고
    • Modularity and community structure in networks
    • Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103, 8577-8582 (2006)
    • (2006) Proc. Natl. Acad. Sci. USA , vol.103 , pp. 8577-8582
    • Newman, M.E.J.1
  • 26
    • 78449246776 scopus 로고    scopus 로고
    • Visualization of Text Streams: A Survey
    • Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010, Springer, Heidelberg
    • Šilić, A., Bašić, B.D.: Visualization of Text Streams: A Survey. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010, Part II. LNCS, vol. 6277, pp. 31-43. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6277 , Issue.PART II , pp. 31-43
    • Šilić, A.1    Bašić, B.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.