Login | Register

Design and implementation of visualization techniques for subsumption hierarchies


Design and implementation of visualization techniques for subsumption hierarchies

Zarrad, Anis (2004) Design and implementation of visualization techniques for subsumption hierarchies. Masters thesis, Concordia University.

Text (application/pdf)
MQ94756.pdf - Accepted Version


Data Visualizing is becoming an important research topic in computer science, and has received considerable attention in the last two decades. In several instances, visualization is a crucial step in order to easily access and properly understand the data. With it, the analysis and the decision making is a relatively easier task. In this thesis, we will focus on the visualization of the concept hierarchies by producing several geometric representations. The main tools used are the graphs where the concepts are represented by vertices and the edges represent the relationships between concepts. Our specific application is the development of a drawing system that interfaces with the description logic reasonner RACER . Unless there is no error in the ontology, the RACER system responds to the taxonomy queries correctly. The body of the response must contain information about a relational structure called a concept hierarchy. This information could be saved as a text file. In the first part of the thesis, we will present our system architecture and discuss its components then we will show how to collect the information about the concept hierarchy using the taxonomy query. We also describe methods for parsing hierarchies and the creation of an appropriate data structure that will be used by the set of algorithms we developed. The second part of the thesis contains the algorithms used to retrieve the properties of the concept hierarchy, as well as to study the specific structure of these hierarchies. It is well known that graph drawing in general is a very complex issue and, therefore, it is important that our approach in drawing takes into account the specificity of these graphs. We consider many aesthetic criteria that fit our specific application: the levels should be kept together as much as possible, the drawing area should be as small as possible, the number of crossings should be minimized, etc. Also, we will develop a decomposition technique that will be very useful in many instances.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Zarrad, Anis
Pagination:ix, 85 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Haarslev, Volker
Identification Number:QA 76.76 C66Z37 2004
ID Code:8132
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:16
Last Modified:13 Jul 2020 20:03
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top