WordNet: a lexical database for English
Communications of the ACM
Self-organizing maps
Jambalaya: an interactive environment for exploring ontologies
Proceedings of the 7th international conference on Intelligent user interfaces
Creating Semantic Web Contents with Protégé-2000
IEEE Intelligent Systems
Faceted metadata for image search and browsing
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Ontology-Based Information Visualisation
IV '01 Proceedings of the Fifth International Conference on Information Visualisation
Infocrystal: a visual tool for information retrieval
VIS '93 Proceedings of the 4th conference on Visualization '93
Communications of the ACM - Supporting exploratory search
RDF data exploration and visualization
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Glycobrowser: a tool for contextual visualization of biological data and pathways using ontologies
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
BRAHMS: a workbench RDF store and high performance memory system for semantic association discovery
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Towards imaging large-scale ontologies for quick understanding and analysis
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Extending faceted navigation for RDF data
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
CropCircles: topology sensitive visualization of OWL class hierarchies
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
| Hi-index | 0.00 |
In this paper we present an algorithm that enhances our previous user-centered, semi-autonomous visualization tool. Our previous tool is used to incrementally explore and visualize large RDF ontologies. Even though this implementation is very fast, hot spots in the graph i.e. nodes with a large number of immediate neighbors, clutter the display and decrease the level of interactivity. We propose a new algorithm that enhances our previous implementation by a) clustering information around hot spots and making the display readable, and b) as a result increase the frame rate and the level of interactivity.