Discovering parametric clusters in social small-world graphs

Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa

Research output: Contribution to conferencePaper

8 Citations (Scopus)

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.

Original languageEnglish (US)
Pages1231-1238
Number of pages8
DOIs
StatePublished - Dec 1 2005
Event20th Annual ACM Symposium on Applied Computing - Santa Fe, NM, United States
Duration: Mar 13 2005Mar 17 2005

Other

Other20th Annual ACM Symposium on Applied Computing
CountryUnited States
CitySanta Fe, NM
Period3/13/053/17/05

Fingerprint

User interfaces
Learning systems
Statistical methods
Visualization

Keywords

  • Graph clustering
  • Graph layout
  • Histogram
  • Information visualization
  • Machine learning
  • Self-organizing map
  • Smallworld graph
  • Social networks
  • User interface design

ASJC Scopus subject areas

  • Software

Cite this

McPherson, J., Ma, K-L., & Ogawa, M. (2005). Discovering parametric clusters in social small-world graphs. 1231-1238. Paper presented at 20th Annual ACM Symposium on Applied Computing, Santa Fe, NM, United States. https://doi.org/10.1145/1066677.1066954

Discovering parametric clusters in social small-world graphs. / McPherson, Jonathan; Ma, Kwan-Liu; Ogawa, Michael.

2005. 1231-1238 Paper presented at 20th Annual ACM Symposium on Applied Computing, Santa Fe, NM, United States.

Research output: Contribution to conferencePaper

McPherson, J, Ma, K-L & Ogawa, M 2005, 'Discovering parametric clusters in social small-world graphs' Paper presented at 20th Annual ACM Symposium on Applied Computing, Santa Fe, NM, United States, 3/13/05 - 3/17/05, pp. 1231-1238. https://doi.org/10.1145/1066677.1066954
McPherson J, Ma K-L, Ogawa M. Discovering parametric clusters in social small-world graphs. 2005. Paper presented at 20th Annual ACM Symposium on Applied Computing, Santa Fe, NM, United States. https://doi.org/10.1145/1066677.1066954
McPherson, Jonathan ; Ma, Kwan-Liu ; Ogawa, Michael. / Discovering parametric clusters in social small-world graphs. Paper presented at 20th Annual ACM Symposium on Applied Computing, Santa Fe, NM, United States.8 p.
@conference{d573b358d385428b9e6004e392de7afd,
title = "Discovering parametric clusters in social small-world graphs",
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.",
keywords = "Graph clustering, Graph layout, Histogram, Information visualization, Machine learning, Self-organizing map, Smallworld graph, Social networks, User interface design",
author = "Jonathan McPherson and Kwan-Liu Ma and Michael Ogawa",
year = "2005",
month = "12",
day = "1",
doi = "10.1145/1066677.1066954",
language = "English (US)",
pages = "1231--1238",
note = "20th Annual ACM Symposium on Applied Computing ; Conference date: 13-03-2005 Through 17-03-2005",

}

TY - CONF

T1 - Discovering parametric clusters in social small-world graphs

AU - McPherson, Jonathan

AU - Ma, Kwan-Liu

AU - Ogawa, Michael

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

KW - Graph clustering

KW - Graph layout

KW - Histogram

KW - Information visualization

KW - Machine learning

KW - Self-organizing map

KW - Smallworld graph

KW - Social networks

KW - User interface design

UR - http://www.scopus.com/inward/record.url?scp=33644608756&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644608756&partnerID=8YFLogxK

U2 - 10.1145/1066677.1066954

DO - 10.1145/1066677.1066954

M3 - Paper

SP - 1231

EP - 1238

ER -