Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/48525
Title: Topology-Inspired Algorithms and Visualisations for In-Depth Data Exploration
Authors: BOT, Daniël Merlijn 
Advisors: Aerts, Jan
Liesenborgs , Jori
Issue Date: 2026
Abstract: The overarching goal of this dissertation was to improve, simplify, and extend data science algorithms to better support analysts in in-depth data exploration. We have explored this goal through the lens of topology-inspired algorithms and visualisations that support analysts discovering patterns that can solve their problems or answer their questions. As such, the research presented in this dissertation fits with the intelligence augmentation perspective ofcomputing that aims to enhance operators’ capability rather than replace them (Engelbart, 1962). The main contribution of this dissertation is a collection of algorithms developed to address specific problems or tasks related to identifying and interpreting patterns in complex and potentially unfamiliar data. The chapters in Part III expand upon the data science literature by presenting novel algorithms that provide additional functionality, improving existing functionality, or simplifying the use of existing techniques. We have published—or contributed to—open-source implementations of all presented algorithms, making our contributions readily available to data science practitioners.
Keywords: Clustering;Dimensionality reduction;Data visualisation;Visual analytics
Document URI: http://hdl.handle.net/1942/48525
Datasets of the publication: 10.5281/ zenodo.15230388
10.5281/ zenodo.13326251
10. 5281/zenodo.11193167
10.5281/zenodo.13929036
Rights: CC BY-NC-ND 4.0
Category: T1
Type: Theses and Dissertations
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
dissertation_jelmer_bot.pdf
  Until 2031-02-20
Published version14.64 MBAdobe PDFView/Open    Request a copy
Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.