Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/48525Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Aerts, Jan | - |
| dc.contributor.advisor | Liesenborgs , Jori | - |
| dc.contributor.author | BOT, Daniël Merlijn | - |
| dc.date.accessioned | 2026-02-17T08:50:27Z | - |
| dc.date.available | 2026-02-17T08:50:27Z | - |
| dc.date.issued | 2026 | - |
| dc.date.submitted | 2026-02-12T18:46:35Z | - |
| dc.identifier.uri | http://hdl.handle.net/1942/48525 | - |
| dc.description.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. | - |
| dc.language.iso | en | - |
| dc.rights | CC BY-NC-ND 4.0 | - |
| dc.subject.other | Clustering | - |
| dc.subject.other | Dimensionality reduction | - |
| dc.subject.other | Data visualisation | - |
| dc.subject.other | Visual analytics | - |
| dc.title | Topology-Inspired Algorithms and Visualisations for In-Depth Data Exploration | - |
| dc.type | Theses and Dissertations | - |
| local.format.pages | 206 | - |
| local.bibliographicCitation.jcat | T1 | - |
| local.type.refereed | Non-Refereed | - |
| local.type.specified | Phd thesis | - |
| local.provider.type | - | |
| local.dataset.doi | 10.5281/ zenodo.15230388 | - |
| local.dataset.doi | 10.5281/ zenodo.13326251 | - |
| local.dataset.doi | 10. 5281/zenodo.11193167 | - |
| local.dataset.doi | 10.5281/zenodo.13929036 | - |
| local.uhasselt.international | no | - |
| item.fulltext | With Fulltext | - |
| item.accessRights | Embargoed Access | - |
| item.fullcitation | BOT, Daniël Merlijn (2026) Topology-Inspired Algorithms and Visualisations for In-Depth Data Exploration. | - |
| item.embargoEndDate | 2031-02-20 | - |
| item.contributor | BOT, Daniël Merlijn | - |
| Appears in Collections: | Research publications | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| dissertation_jelmer_bot.pdf Until 2031-02-20 | Published version | 14.64 MB | Adobe PDF | View/Open Request a copy |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.