Discovering parametric clusters in social small-world graphs

  • Authors:
  • Jonathan McPherson;Kwan-Liu Ma;Michael Ogawa

  • Affiliations:
  • University of California at Davis;University of California at Davis;University of California at Davis

  • Venue:
  • Proceedings of the 2005 ACM symposium on Applied computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.