University of Miami Libraries > UM Libraries Digital Collections > Digital Scholarship Digital Collections > Caribbean Writers Summer Institute > Visualization

The Caribbean Writers Summer Institute (CWSI) Archival Video Collection provides a searchable video archive of talks given at the 1991-1996 Caribbean Writer's Summer Institute sponsored by Caribbean Literary Studies, Department of English at the University of Miami.

A force-directed graph (or visualization) of co-occurring subject terms assigned by a metadata librarian across 327 CWSI talks was created using d3.js. The software clusters subjects that co-occur into independent thematic graphs. The size of the node bubble indicates subject frequency, and the width of the connections between subjects (edges) indicate the strength of the relationship between the shared terms. After the graphs were generated the groups were given names based on an analysis of the terms within the clusters.

Link to video talks by hovering and double clicking on the term's node bubble

Display the Visualization

Additional information:

  • the size of the node bubbles represent total mentions of that subject
  • the thickness of the connections between nodes represent the number of co-occurrences
  • zoom & pan using the mouse
    • to zoom in click the left mouse button
    • to zoom in or out use the mouse scroll
    • pan by dragging the visualization with the mouse
  • in addition, the right hand menu contains controls
    • to search on terms within & across themes
    • to hide & display themes
    • to zoom & pan
  • link to video talks : hover & double click on a node bubble
  • Chrome is recommended for displaying and manipulating the visualization

What is a force-directed graph?

Force-directed graph (or visualization) drawing algorithms assign forces among the set of edges and the set of nodes of a graph drawing. The algorithm positions the nodes of a graph in two-dimensional or three-dimensional space so that all the edges are of more or less equal length and there are as few crossing edges as possible, by assigning forces among the set of edges and the set of nodes, based on their relative positions, and then using these forces either to simulate the motion of the edges and nodes or to minimize their energy.

Project development: Lyn MacCorkle. Data Preparation: Tim Thompson. d3 Visualization: Sevika Singh.