Abstract
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualization and navigation, and allows the user to navigate the graph in real time. First, the algorithm calculates the weight for each vertex by an improved link analysis method. Second, representative vertices with higher weights are selected. Third, a wavefront algorithm is utilized to cluster neighboring vertices for each representative vertex. This step produces several clusters characterized by the representative vertices. Then steps two and three are repeated in each cluster to form an LOD tree. Finally, we use a force-directed method to draw the sub-graph under the non-leaf node of the LOD tree. Based on the proposed method, we develop a graph visualization and navigation system—DynamicViewer. We then demonstrate its application in Web navigation. With DynamicViewer, the user can have an overview of the Web and then browse individual information on demand. The experiment results show that DynamicViewer enhances the ability to provide the right information to the user.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.: Algorithms for drawing graphs: an annotated bibliography. Computational Geometry 4(5), 235–282 (1994)
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.: Graph drawing. Prentice-Hall, New Jersey (1999)
Davidson, R., Harel, D.: Drawing graph nicely using simulated annealing. ACM Transaction on Graphics 15(4), 301–331 (1996)
Eades, P.: A heuristic for graph drawing. Congressus Numerantium, pp. 149–160 (1984)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software – practice & Experience 2(11), 1129–1164 (1991)
Furnas, G.W.: Generalized fisheye views. In: Proceedings of the ACM SIGCHI 1986 Conference on Human Factors in Computing Systems, Boston, Massachussetts, pp. 15–22. ACM Press, New York (1986)
Gajer, P., Kobourov, S.: GRIP: Graph drawing with intelligent placement. Journal of Graph Algorithms and Applications 6(3), 203–224 (2002)
Hadany, R., Harel, D.: A multi-scale method for drawing graphs Nicely. Discrete Applied Mathematics 113(1), 3–21 (2001)
Ham, F.V., Wetering, H., Wijk, J.: Interactive visualization of state transition systems. IEEE Transactions on Visualization and Computer Graphics 8(3), 1–11 (2002)
Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 183–196. Springer, Heidelberg (2001)
Hendley, R.J., Drew, N.S., Wood, A., Beale, R.: Narcissus: Visualizing Information. In: Proceedings of the 1995 Information Visualization Symposium, Atlanta, GA, pp. 90–96 (1995)
Herman, I., Melancon, G., Marshall, M.S.: Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 6(1), 24–43 (2000)
Huang, M.L., Eades, P.: A fully animated interactive system for clustering and navigating huge graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 374–383. Springer, Heidelberg (1999)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing letters 31(1), 7–15 (1989)
Karvounarakis, G., Christophides, V., Plexousakis, D., Alexaki, S.: Querying RDF descriptions for community Web portals. In: Proceedings of the French National Conference on Databases (BDA 2001), Agadir, Maroc, pp. 133–144 (2001)
Kaufmann, M., Wagner, D.: Drawing graphs: methods and models. Springer, Heidelberg (2001)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)
Koren, Y., Carmel, L., Harel, D.: ACE: A fast multiscale eigenvector computation for drawinghuge graphs. In: Proceedings of IEEE Information Visualization, pp. 137–144 (2002)
Miller, J.C., Rae, G., Schaefer, F.: Modifications of Kleinberg’s HITS algorithm using matrix exponentiation and web log records. In: SIGIR 2001, New Orleans, Louisiana, USA, September 9-12, pp. 444–445 (2001)
Munzner, T., Burchard, P.: Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space. In: Proceedings of VRML 1995, San Diego, CA, pp. 33–38 (1995)
Qadah, G.Z.: The wavefront and δ-wavefront algorithms: a comparative study. International Phoenix Conference on Computers and Communications, 799–805 (1991)
Quinn, N., Breur, M.: A force directed component placement procedure for printed circuit boards. IEEE Transactions of Circuits and Systems 26(6), 377–388 (1979)
Risch, J.S., Rex, D.B., Dowson, S.T., Walters, T.B., May, R.A., Moon, B.D.: The STARLIGHT information visualization system. In: Proceedings of the IEEE Conference on Information Visualization, pp. 42–49 (1997)
Robertson, G.G., Markinlay, J.D., Card, S.K.: Cone tree: animated 3D visualizations of hierarchical information. In: Proceedings of the ACM SIGCHI 1991 Conference on Human Factors in Computing Systems, pp. 189–194 (1991)
Roxborough, T., Sen, A.: Graph clustering using multiway ratio cut. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 291–296. Springer, Heidelberg (1997)
Shiozawa, H., Matsushita, Y.: WWW visualization giving meanings to interactive manipulations. In: Liu, S., et al. (eds.) Advances in Human Factors/Ergonomics 21B (HCI International 1997), San Francisco, CA, pp. 791–794 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, S., Pan, Y., Yang, L., Liu, W. (2005). An LOD Model for Graph Visualization and Its Application in Web Navigation. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds) Web Technologies Research and Development - APWeb 2005. APWeb 2005. Lecture Notes in Computer Science, vol 3399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31849-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-31849-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25207-8
Online ISBN: 978-3-540-31849-1
eBook Packages: Computer ScienceComputer Science (R0)