2009 IEEE Symposium on Visual Analytics Science and Technology 2009
DOI: 10.1109/vast.2009.5333893
|View full text |Cite
|
Sign up to set email alerts
|

Visual analysis of graphs with multiple connected components

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
40
0
1

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 45 publications
(42 citation statements)
references
References 27 publications
1
40
0
1
Order By: Relevance
“…Thus, they are not suitable for grouping the time steps according to the similarity of the flow patterns. As the flows form spatio-temporal graphs, we hoped to use graph-based features for clustering [49], in particular, the degree, centrality, and clustering measures of the nodes. None of the graph centralities of nodes reflect movement direction.…”
Section: Discussionmentioning
confidence: 99%
“…Thus, they are not suitable for grouping the time steps according to the similarity of the flow patterns. As the flows form spatio-temporal graphs, we hoped to use graph-based features for clustering [49], in particular, the degree, centrality, and clustering measures of the nodes. None of the graph centralities of nodes reflect movement direction.…”
Section: Discussionmentioning
confidence: 99%
“…In the first of these, users iteratively choose pipeline parameters and examine the outputs, until the solution is satisfactory. Some techniques are primarily computational, often incorporating data mining methods, and examples include dimension reduction [6], clustering [7] and classification [8]. However, visualization is an inherent part of others approaches, for example, using statistical learning techniques to make a real-time prediction of the results for regions of parameter settings [9].…”
Section: Methods For Pipeline Design and Optimizationmentioning
confidence: 99%
“…There are techniques for multiple graph comparison [16,33,48]. They only analyze global similarities without subgraph matching.…”
Section: Visual Comparison Of Multiple Graphsmentioning
confidence: 99%