CMGV: a unified framework for complexity management in graph visualization

buir.advisorDoğrusöz, Uğur
dc.contributor.authorZafar, Osama
dc.date.accessioned2023-08-16T10:43:46Z
dc.date.available2023-08-16T10:43:46Z
dc.date.copyright2023-08
dc.date.issued2023-08
dc.date.submitted2023-08-15
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionIncludes bibliographical references (leaves 64-66).en_US
dc.description.abstractIn today’s era of technological revolution, the sheer volume of data being produced poses a significant challenge for analyzing relational data of such scale, particularly in terms of visual analysis. Graphs provide an effective way of organizing and representing relational data, with nodes representing entities. In contrast, edges representing relationships, a comprehensive and intuitive view of complex large-scale data is created. A well-represented visualization of complex graphs allows users to understand relationships, uncover new insights, and discover hid-den patterns. To this end, we introduce a complexity management framework for effectively analyzing large-scale relational data represented as graphs. Existing methods for managing graph complexity work independently and may lead to in-consistencies and confusion consecutively applied. The Complexity Management Graph Visualization framework (CMGV) presents a novel approach integrating commonly used complexity management techniques while ensuring the preservation of the user’s mental map through a specialized layout algorithm. The frame-work introduces an intuitive Graph Complexity Management Model (CMGM) for both graph representation and complexity management. CMGV supports commonly utilized complexity management tasks, including filtering, hiding, showing, collapsing, and expanding graph elements. Importantly, CMGV is designed to be independent of the rendering method and can be seamlessly integrated with different graph rendering libraries. This is possible through an extension that synchronizes the graph models between the rendering library and CMGM. Our experiments performed on randomly generated graphs verify that CMGV flawlessly performs consecutive graph complexity management operations, leaving the user graph intact, and outperforms existing complexity management solutions in terms of both runtime and generally accepted graph layout criteria. It is fast enough to be used in interactive applications with small to medium-sized graphs.
dc.description.statementofresponsibilityby Osama Zafar
dc.embargo.release2024-02-10
dc.format.extentxiii, 69 leaves : charts ; 30 cm.
dc.identifier.itemidB162318
dc.identifier.urihttps://hdl.handle.net/11693/112661
dc.language.isoEnglish
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectInformation visualization
dc.subjectGraph visualization
dc.subjectGraph complexity management
dc.subjectVisual analysis
dc.subjectGraph visualization software
dc.titleCMGV: a unified framework for complexity management in graph visualization
dc.title.alternativeCMGV: çizge görselleştirmede karmaşıklık yönetimi için birleşik bir çerceve
dc.typeThesis
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B162318.pdf
Size:
9.35 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: