By Topic

Preserving proximity relations and minimizing edge-crossings in high dimensional graph visualizations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shabbeer, A. ; Rensselaer Polytech. Inst., Troy, NY, USA ; Ozcaglar, C. ; Yener, B. ; Bennett, K.P.

We propose a novel approach to drawing graphs that simultaneously optimizes two criteria (i) preserving proximity relations as measured by some embedding objective, and (ii) minimizing edge crossings, to create a clear representation of the underlying graph structure. Frequently, the nodes of the graph represent objects that have their own intrinsic properties with associated distances or similarity measures.

Published in:

Large Data Analysis and Visualization (LDAV), 2011 IEEE Symposium on

Date of Conference:

23-24 Oct. 2011