Effectively visualizing large networks through sampling

Proceedings of the IEEE Visualization Conference

Volumn , Issue , 2005, Pages 48-

  Rafiei, Davood ^a   Curial, Stephen ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Large network visualization; Network sampling; Visualizing the Web

Indexed keywords

LARGE NETWORK VISUALIZATION; NETWORK SAMPLING; WEB VISUALIZING;

ABSTRACTING; COMPUTER GRAPHICS; COMPUTER SOFTWARE; DATABASE SYSTEMS; PROBLEM SOLVING; SAMPLING;

COMPUTER NETWORKS;

EID: 33749445428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VIS.2005.25     Document Type: Conference Paper

References (33)

1. J. Abello, I. Finocchi, and J. Korn. Graph sketches. In Proc. of the IEEE Symposium on Information Visualization, pages 67-70, San Diego, October 2001.
2. J. Abello, J. Korn, and M. Kreuseler. Navigating giga-graphs. In Proc. of the working conference on advanced visual interfaces (AVI), 2002.
3. L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003.
4. D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon. Multiscale visualization of small world networks. In Proc, of IEEE Symposium on Information Visualization, pages 75-81, 2003.
5. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about Web pages via random walks. In Proc. of the VLDB Conference, pages 535-544, Cairo, September 2000. Morgan Kaufmann.
6. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the Web. In Proc. of the World Wide Web Conference, pages 309-320, Amsterdam, May 2000.
7. S. Chaudhuri, R. Motwani, and V. Narasayya. On random sampling over joins. In Proc. of the SIGMOD Conference, pages 263-274. ACM Press, 1999.
8. A. Crosby. The Measure of Reality: Quantification in Western Europe, 1250-1600. Cambridge University Press, 1997. A summary is online atwww.stolaf.edu/other/ql/crosby.html.
9. S. Dill, R. Kumar, K. Mccurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. Self-similarity in the Web. In Proc. of the VLDB Conference, pages 69-78, September 2001.
10. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
11. O.Frank, Estimation of the number of connected components in a graph by using a sampled subgraph. Scandinavian Journal of Statistics, 5:177-188, 1978.
12. A. Frick, A. Ludwig, and H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. In Proceedings of Graph Drawing '94, Lecture Notes in Computer Science 894, pages 388-403. Springer-Verlag, 1994.
13. G. Furnas. Generalized fisheye views. In Proc. of the Conference on Human Factors in Computing Systems, pages 16-23. ACM, 1986.
14. E. Gansner, Y. Koren, and S. North. Topological fisheye views for visualizing large graphs. In Proc. of the IEEE Symposium on Information Visualization, 2004.
15. P. Haas and C. Koenig. A bi-level bernoulli scheme for database sampling. In Proc. of the SIGMOD Conference, pages 275-286, Paris, 2004. ACM Press.
16. M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform url sampling. In Proc. of the World Wide Web Conference, pages 295-308, Amsterdam, May 2000. Elsevier Science.
17. I. Herman, M. Marshall, G. Melancon, D. Duke, M. Delest, and J.-P. Domenger. Skeletal images as visual cues in graph visualization. In Proc. of the Data Visualization, pages 13-29, 1999.
18. J. Huotari, K. Lyytinen, and M. Niemel. Improving graphical information system model use with elision and connecting lines. ACM Transactions on Computer-Human Interaction, 11(1):26-58, March 2004.
19. J. Kleinberg. Authoritative sources in a hyperlinked environment. In Proc. of ACM-SIAM Symposium on Discrete Algorithms, pages 668-677, January 1998.
20. A. Klovdahl. A note on linages of networks. Social Networks, 3:197-214, 1981.
21. V. Krishnamurthy, J. Sun, M. Faloutsos, and S. Tauro. Sampling Internet topologies: how small can we go? In Proc. of International Conference on Internet Computing, Las Vegas, 2003.
22. LEDA. class library. www.algorithmic-solutions,com/enleda.htm.
23. A. Mendelzon. Visualizing the world wide web. In Proc. of the working conference on advanced visual interfaces (AVI), 1996.
24. T. Munzner. Interactive visualization of large graphs and networks. PhD thesis, Stanford University, 2000.
25. E. Noik. Dynamic fisheye views: combining dynamic queries and mapping with database views. PhD thesis, University of Toronto, 1996.
26. F. Olken. Random Sampling from Databases. PhD thesis, University of California at Berkeley, 1993.
27. F. Olken and D. Rotem. Random sampling from databases - a survey. Statistics and Computing, 5(1):25-42, March 1995.
28. C. Palmer, P. Gibbons, and C. Faloutsos. Data mining on large graphs. In Proc. ACM Intl. Conf. on SIGKDD, pages 81-90, 2002.
29. C. Plaisant, J. Grosjean, and B. Bederson. Spacetree: supporting exploration in large node link tree, design evolution and empirical evaluation. In Proc. of the IEEE Symposium on Information Visualization, pages 57-66, Boston, October 2002.
30. D. Rafiei and S. Curial. ALVIN: a system for visualizing large networks. In Poster Proc. of the World Wide Web Conference, May 2005.
31. S. Thompson. Sampling. Wiley, 2nd edition, 2002.
32. Tulip, www.tulip-software.org.
33. D. Watts. Small worlds: the dynamics of networks between order and randomness. Princeton University Press, 1999.