ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Discovering parametric clusters in social small-world graphs
Full text PdfPdf (550 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents
Santa Fe, New Mexico
SESSION: Multimedia and visualization (MV) table of contents
Pages: 1231 - 1238  
Year of Publication: 2005
ISBN:1-58113-964-0
Authors
Jonathan McPherson  University of California at Davis
Kwan-Liu Ma  University of California at Davis
Michael Ogawa  University of California at Davis
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 139,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066677.1066954
What is a DOI?

ABSTRACT

We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different research areas, including graph layout, graph clustering and partitioning, machine learning, and user interface design. It helps users explore the networks and develop insights concerning their members and structure that may be difficult or impossible to discover via traditional means, including existing graph visualization and/or statistical methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Albert, R., and Baraba si, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74 (2002), 47--97.
 
3
Albert, R., Jeong, H., and Bar'a basi, A.-L. Diameter of the world wide web. Nature 401 (1999), 130--131.
 
4
Auber, D., Chiricota, Y., Jourdan, F., and Melancon, G. Multiscale visualization of small world networks. In Proceedings of the 2003 IEEE Symposium on Information Visualization (2003), pp. 75--81.
 
5
 
6
 
7
Herman, I., Marshall, M. S., Melancon, G., Duke, D. J., Delest, M., and Domenger, J.-P. Skeletal images as visual cues in graph visualization. In Data Visualization '99, E. Gröller, H. Löffelmann, and W. Ribarsky, Eds. Springer-Verlag Wien, 1999, pp. 13--22.
 
8
 
9
 
10
 
11
 
12
Noack, A. An energy model for visual graph clustering. In Proceedings of the 11th International Symposium on Graph Drawing (2003), pp. 425--436.
 
13
 
14
Stasko, J. T., and Wehrli, J. F. Three-dimensional computation visualization. In Proc. IEEE Symp. Visual Languages, VL (24-27 1993), E. P. Glinert and K. A. Olsen, Eds., IEEE Computer Society, pp. 100--107.
 
15
van Dongen, S. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
 
16
17
 
18
Watts, D., and Strogatz, S. Collective dynamics of small-world networks. Nature 393 (1998), 440--442.

Collaborative Colleagues:
Jonathan McPherson: colleagues
Kwan-Liu Ma: colleagues
Michael Ogawa: colleagues