This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in ISI Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Google Scholar Articles by DeJordy, R. Articles by Halgin, D. S. Search for Related Content Social Bookmarking                   What's this?

Visualizing Proximity Data

Boston College

Stephen P. Borgatti

Boston College

Chris Roussin

Boston College

Daniel S. Halgin

Boston College

In this article, the authors explore the use of graph layout algorithms for visualizing proximity matrices such as those obtained in cultural domain analysis. Traditionally, multidimensional scaling has been used for this purpose. The authors compare the two approaches to identify conditions when each approach is effective. As might be expected, they find that multidimensional scaling shines when the data are of low dimensionality and are compatible with the defining characteristics of Euclidean distances, such as symmetry and triangle inequality constraints. However, when one is working with data that do not fit these criteria, graph layout algorithms do a better job of communicating the structure of the data. In addition, graph layout algorithms lend themselves to interactive use, which can yield a deeper and more accurate understanding of the data.

Key Words: multidimensional scaling • visualization • social network analysis • graph layout algorithms • cultural domain analysis • proximity matrices

CiteULike    Connotea    Del.icio.us    Digg    Reddit    Technorati    What's this?