Preserving proximity relations and minimizing edge-crossings in high dimensional graph visualizations.
Amina ShabbeerCagri OzcaglarBülent YenerKristin P. BennettPublished in: LDAV (2011)
Keyphrases
- high dimensional
- weighted graph
- dependency graph
- undirected graph
- disjoint paths
- edge weights
- directed graph
- edge information
- shortest path
- random walk
- similarity search
- nearest neighbor
- connected components
- vertex set
- low dimensional
- graph structures
- social graphs
- high dimensional data
- proximity search
- graph model
- data visualization
- graph structure
- graph theory
- high dimensionality
- structured data
- data sets
- proximity measures
- higher order relations
- visualization tools
- directed acyclic graph
- input space
- graph matching
- semantic relations
- multi dimensional
- edge detection
- graph theoretic
- graph databases
- dimensionality reduction
- feature space