2014
DOI: 10.12785/amis/080145
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Visualization of Semantic Nets using Power-Law Graphs

Abstract: Scalability and performance implications of semantic net visualization techniques are open research challenges. This paper focuses on developing a visualization technique that mitigates these challenges. We present a novel approach that exploits the underlying concept of power-law degree distribution as many realistic semantic nets seems to possess a power law degree distribution and present a small world phenomenon. The core concept is to partition the node set of a graph into power and non-power nodes and to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0
1

Year Published

2014
2014
2019
2019

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 31 publications
0
31
0
1
Order By: Relevance
“…Some visualization tools such as OWLViz (Horridge, ), KC‐Viz (Motta, Peroni, Gómez‐Pérez, d'Aquin, & Li, ), and GrOWL (Krivov, Williams, & Villa, ) do not support search. However, Jambalaya (Storey et al, ), NavigOWL (Hussain et al, ), OntoGraf (Falconer, ), and WebVOWL support keyword search option. MEMO GRAPH (Ghorbel et al, ) is a user‐friendly ontology visualization tool especially designed to be used by everyone.…”
Section: Discussionmentioning
confidence: 99%
“…Some visualization tools such as OWLViz (Horridge, ), KC‐Viz (Motta, Peroni, Gómez‐Pérez, d'Aquin, & Li, ), and GrOWL (Krivov, Williams, & Villa, ) do not support search. However, Jambalaya (Storey et al, ), NavigOWL (Hussain et al, ), OntoGraf (Falconer, ), and WebVOWL support keyword search option. MEMO GRAPH (Ghorbel et al, ) is a user‐friendly ontology visualization tool especially designed to be used by everyone.…”
Section: Discussionmentioning
confidence: 99%
“…5 is a diagram of network topologies used in the following experiments. Every network topology is formed by 100 routers and 1001 peers (1 source peer and 1000 receiver peers) and follows a power-law degree structure [17], [18]. The routers and the peers present the cores and the edges of the network, respectively.…”
Section: Performance Evaluationsmentioning
confidence: 99%
“…Unfortunately, the different ontology elements are often hard to distinguish in the visualizations. For instance, TGViz [5] and NavigOWL [22] use very simple graph visualizations where all nodes and links look the same except for their color. This is different in GrOWL [24] and SOVA [25], which define more elaborated notations using different symbols, colors, and node shapes.…”
Section: Graph Visualizations Of Ontologiesmentioning
confidence: 99%