KIT | KIT-Bibliothek | Impressum | Datenschutz

Time-Efficient Analysis of Complex Dependencies

Vollmer, Michael

Abstract (englisch):
The volumes of data that are collected and analyzed in all aspects of life rise steadily and offer numerous challenges and opportunities. When analyzing large volumes of data, two main considerations are the capability to detect relationships within the data and the time efficiency necessary when processing the data. Large data sets in particular often contain dependencies that are less obvious than linear or proportional relationships. Such complex dependencies could be quantified and analyzed with methods from the field of information theory. In this dissertation, we study time-efficient methods to detect, quantify and illustrate complex dependencies.

Open Access Logo


Volltext §
DOI: 10.5445/IR/1000105784
Veröffentlicht am 13.02.2020
Coverbild
Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Hochschulschrift
Jahr 2020
Sprache Englisch
Identifikator KITopen-ID: 1000105784
Verlag Karlsruhe
Umfang X, 121 S.
Abschlussart Dissertation
Fakultät Fakultät für Informatik (INFORMATIK)
Institut Institut für Programmstrukturen und Datenorganisation (IPD)
Prüfungsdatum 04.02.2020
Referent/Betreuer Prof. K. Böhm
Projektinformation GRK 2153/1 (DFG, DFG KOORD, GRK 2153/1)
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page