28.06.2013 Views

Papers in PDF format

Papers in PDF format

Papers in PDF format

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

as measured by co-occurrence of keywords between document pairs. For the network of terms, or associative<br />

term thesaurus, and the visual representation of the user’s query the associations are derived from text with association<br />

measured by keyword co-occurrence and lexical distance with<strong>in</strong> documents. The networks used <strong>in</strong><br />

the system are Pathf<strong>in</strong>der networks (PfNets) [Dearholt & Schvaneveldt, 1990], which can be conceptualized as<br />

path length limited m<strong>in</strong>imum cost networks. Algorithms to derive m<strong>in</strong>imum cost spann<strong>in</strong>g trees have only the<br />

constra<strong>in</strong>ts that the network is connected and cost, as measured by the sum of l<strong>in</strong>k weights, is a m<strong>in</strong>imum. For<br />

PfNets, an additional constra<strong>in</strong>t is added: Not only must the graph be connected and m<strong>in</strong>imum cost, but also<br />

that the longest path length, as measured by number of l<strong>in</strong>ks, is less than some criterion.<br />

Reduc<strong>in</strong>g of the complexity of network representations is a central objective <strong>in</strong> many efforts <strong>in</strong> visualiz<strong>in</strong>g<br />

Internet <strong>in</strong><strong>format</strong>ion structures. Complexity can be reduced by transform<strong>in</strong>g the network of connectivity<br />

among documents to a hierarchy by remov<strong>in</strong>g l<strong>in</strong>ks. Compared to the more general problem of represent<strong>in</strong>g<br />

directed graphs, visualization of hierarchies is relatively well developed. This sort of trans<strong>format</strong>ion is used by<br />

Mukherjea et al. [Mukherjea et al., 1995] for WWW documents. In the Document Explorer nodes <strong>in</strong> the<br />

complete network are identified for display and navigation <strong>in</strong> a fashion similar to the identification of cluster<br />

centroids <strong>in</strong> s<strong>in</strong>gle l<strong>in</strong>k cluster<strong>in</strong>g. These document nodes are cont<strong>in</strong>uously displayed <strong>in</strong> the overview diagram<br />

and the three-dimensional space with<strong>in</strong> which the user navigates. The location of the subnetwork displayed <strong>in</strong><br />

the ma<strong>in</strong> view<strong>in</strong>g w<strong>in</strong>dow is updated cont<strong>in</strong>uously <strong>in</strong> the overview diagrams as the user moves through the<br />

three-dimensional network display space.<br />

Additionally, the system uses networks of differ<strong>in</strong>g densities to provide separate views of document and<br />

term <strong>in</strong>terrelationships. The least dense PfNet, which allows paths of any length <strong>in</strong> satisfy<strong>in</strong>g the m<strong>in</strong>imum<br />

cost criterion, is useful for global navigation and orientation. Conceptually, it shows the strongest relations<br />

among elements. As such, it is effective <strong>in</strong> supply<strong>in</strong>g views for global navigation and structure perception. To<br />

provide a more detailed view of relationships the system also ma<strong>in</strong>ta<strong>in</strong>s a PfNet of elements <strong>in</strong> which the<br />

maximum path length is relatively small, creat<strong>in</strong>g a complementary network with many more l<strong>in</strong>ks. This more<br />

dense network display is most beneficial when view<strong>in</strong>g a small set of elements and serves as a sort of magnify<strong>in</strong>g<br />

glass for reveal<strong>in</strong>g relations among elements not shown <strong>in</strong> the sparse network.<br />

2.2 Spatial representation of the system’s networks<br />

The spatial representation of the system’s networks is designed to visually reveal structure. Network<br />

nodes are positioned <strong>in</strong> three dimensions us<strong>in</strong>g a graph layout algorithm based on a spr<strong>in</strong>g metaphor [Kumar<br />

& Fowler, 1994] similar to Kamada and Kawai’s two-dimensional network layout algorithm [Kamada & Kawai,<br />

1989]. Nodes are treated as connectors and spr<strong>in</strong>g length and strength among connectors is derived from<br />

network l<strong>in</strong>k distances. Nodes are allowed to vary <strong>in</strong> three dimensions and iteratively positioned at the po<strong>in</strong>ts<br />

which m<strong>in</strong>imize energy <strong>in</strong> the system of spr<strong>in</strong>gs. Vary<strong>in</strong>g spr<strong>in</strong>g length and strength allows layouts which are<br />

useful for user <strong>in</strong>teraction and visually reveal cluster<strong>in</strong>g and connectivity among.<br />

2.3 Display and <strong>in</strong>teraction mechanisms<br />

The size and density of the system’s WWW document network requires view<strong>in</strong>g and navigation tools that<br />

allow users to perceive the overall structure of document relations, explore smaller regions <strong>in</strong> detail, and select<br />

and view <strong>in</strong>dividual documents. Display and <strong>in</strong>teraction mechanisms <strong>in</strong> the Document Explorer supply orientation<br />

and overview of the global structure of document associations, together with navigation and retrieval<br />

tools for explor<strong>in</strong>g local detail. The overview diagram of the complete network is constructed us<strong>in</strong>g the nodes<br />

of highest degree <strong>in</strong> the network. As the user changes viewpo<strong>in</strong>t <strong>in</strong> the ma<strong>in</strong> view<strong>in</strong>g w<strong>in</strong>dow, and thus the<br />

portion of the network which is viewed <strong>in</strong> detail, the overview diagram tracks the overview nodes which are<br />

visible <strong>in</strong> the view volume of the detailed view. This helps attenuate disorientation by provid<strong>in</strong>g the context<br />

for the <strong>in</strong>dividual network nodes which are <strong>in</strong> view. We have also explored stereoscopic display of the networks.<br />

For the sorts of network displays <strong>in</strong> the Document Explorer there is a significant <strong>in</strong>crease <strong>in</strong> the user’s<br />

ability to perceive structure, as found <strong>in</strong> recent studies of stereoscopic network view<strong>in</strong>g [Ware Franck, & 1996].<br />

Other display mechanisms for chang<strong>in</strong>g the user’s views of the network are also designed to assist the<br />

user <strong>in</strong> rema<strong>in</strong><strong>in</strong>g oriented to the overall structure while exam<strong>in</strong><strong>in</strong>g local detail, such as the availability of two<br />

separate networks which differ <strong>in</strong> density, or the number of l<strong>in</strong>ks. The most sparse is essentially a tree, thus<br />

hav<strong>in</strong>g the fewest l<strong>in</strong>ks necessary to have all nodes connected. It is this sparse network which is used to provide<br />

the spr<strong>in</strong>g analogs used to position the nodes <strong>in</strong> three-dimensional space. In practice the arrangement of<br />

nodes on this basis supplies a characteristic cluster<strong>in</strong>g of nodes <strong>in</strong> which structure is relatively easy to perceive,<br />

such as shown <strong>in</strong> the leftmost bookmark of Figure 1. Yet, much of the utility of brows<strong>in</strong>g <strong>in</strong> the derived se-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!