Cited by 57Data Visualization and AnalyticsComplex Network Analysis TechniquesGraph Theory and Algorithms

Group-in-a-Box Layout for Multi-faceted Analysis of Communities

Rodrigues, Eduarda Mendes, Milic-Frayling, Natasa, Smith, Marc, Shneiderman, Ben, Hansen, Derek·2011·2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing

Abstract

Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a meta-layout for clustered graphs that enables multi-faceted analysis of networks. It uses the tree map space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.

Integrity signals

Registry

Crossref · 10.1109/passat/socialcom.2011.139

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • El algoritmo Clauset-Newman-Moore busca grupos de vértices que estén conectados densamente entre ellos y que posean pocas conexiones con otros grupos.

    “Dicho algoritmo busca grupos de vértices que estén conectados densamente entre ellos y que posean pocas conexiones con otros grupos (Clauset et al., 2004;Mendes Rodrigues et al., 2011).”
  • En el campo del análisis de redes sociales no existe una metodología única y establecida, por lo que la mayor parte de las investigaciones, como esta, tienen un carácter exploratorio y experimental.

    “En el campo del análisis de redes sociales no existe una metodología única y establecida, por lo que la mayor parte de las investigaciones, como esta, tienen un carácter exploratorio y experimental (Himelboim, et al., 2017;Mendes Rodrigues et al., 2011).”

Cited by

Sorted by citations

Authors
Rodrigues, E. M., Milic-Frayling, N., Smith, M., Shneiderman, B., & Hansen, D.
Affiliations
  • Universidade do Porto (PT)
  • University of Maryland, College Park (US)
Venue
2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing
Publisher
IEEE
Published
2011-10
Pages
354-361
OpenAlex
W2538898197
Cited by
57
References
0
Citations by year
2026: 1 · 2025: 2 · 2024: 3 · 2023: 2 · 2022: 6 · 2021: 2 · 2020: 2 · 2019: 7 · 2018: 5 · 2017: 6 · 2016: 4 · 2015: 3 · 2014: 8 · 2013: 3 · 2012: 3
FWCI
3.34
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Social Computing (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Data Visualization and Analytics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
Keywords
graph layout, social network visualization, community structure, treemaps, space-filling curves, clustered graphs

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review