Bachelor- und Masterarbeiten
Themen
Viele Aufgabenstellungen beschäftigen sich mit der Implementierung verschiedener Komponenten in eines der Websysteme, die am Fachgebiet betrieben werden, oder mit der Analyse der in solchen Systemen vorhandenen Daten. Darüber hinaus werden weitere Themen angeboten, die in der Regel einen inhaltlichen Bezug zu aktuellen Forschungsprojekten des Fachgebiets Wissensverarbeitung haben.
Die Themenstellung erfolgt in Absprache mit den Studierenden; die Ausrichtung und der Umfang der Arbeit richten sich nach dem jeweils angestrebten Anschluss. Prinzipiell liegt der Schwerpunkt bei Abschlussarbeiten auf der Methodik, während er bei Projektarbeiten auf der technischen Umsetzung liegt.
Zu folgenden Themengebieten können wir Arbeiten anbieten; zu konkreten Themen können die jeweiligen Betreuer genauere Auskunft geben:
Evaluating Attribute Partitions for Nested Line Diagrams
Nested line diagrams decompose a formal context into multiple conceptual scales, allowing complex concept lattices to be represented through smaller, interacting factor lattices. The choice of how attributes are partitioned into these scales can strongly influence the structure, complexity, and interpretability of the resulting diagram. This project aims to investigate how the quality of such attribute partitions can be quantified using FCA-based measures, for example the cross-scale implication structure, or the proportion of realized nodes in the corresponding product lattice. Different quality measures will be developed and compared on synthetic and real-world contexts, with the longer-term goal of using them to recommend or automatically identify suitable partitions.
Inquiries: Anurag Sharma
Drawing Line Diagrams through Sublattice Anchoring
Structural patterns such as n-dimensional cubes, diamonds (M3), or pentagons (N5) frequently occur in lattices of real-world data. Identifying and highlighting these well-known sublattices simplifies the interpretation of complex relational data by anchoring the visualization to familiar geometric forms. This project aims to develop a drawing algorithm that detects a predefined sublattice, pins its nodes to fixed positions, and subsequently arranges the remaining structure around this scaffold to investigate how different anchor choices improve lattice readability.
Inquiries: Marcel Nöhre
A Doubly-Additive Extension of Freese’s Algorithm
Doubly-additive line diagrams define a concept’s position as the sum of vectors from its extent and complement intent, which naturally produces parallelograms, making the lattice easier to read and enabling interactive features such as drag-and-drop editing. However, the core challenge lies in finding a vector assignment that yields a readable drawing rather than a cluttered one. Therefore, this project aims to extend the force-directed approach of Ralph Freese’s lattice drawing algorithm by optimizing base vectors, rather than refining node positions directly.
Inquiries: Marcel Nöhre
The Lattice of Relations between Multiple Squares
In the book Conceptual Exploration by Ganter and Obiedkov (2016), Section 4.2.2 gives the example of exploring the different ways of arranging two squares in two dimensions. Later, in Section 6.1.1, the authors also consider part of the problem for the case of three squares. In this mostly theoretical project or thesis, we want to consider the complete case of three squares and, if possible, compute the lattice for the general four square setting.
Inquiries: Mo Abdulla
The Truncated Birkhoff Completion
In the Birkhoff completion, certain concepts, especially in the lower part of the lattice, are generated by new objects derived from implications. However, these objects may introduce inconsistent or unrealistic combinations of attributes. Truncating the lattice by eliminating such inconsistencies ensures a more meaningful and applicable structure, particularly in real-world scenarios. This project aims to study the truncated Birkhoff completion as a method for addressing inconsistencies that arise in lattice structures generated through the Birkhoff completion of non-distributive lattices.
Inquiries: Mo Abdulla
Sprechen Sie uns gern zu weiteren Themen an. Informationen zu den einzelnen Themen geben Ihnen gerne vorab die Betreuer.
Aufgabenstellung und Termin
Nach Absprache mit dem jeweiligen Betreuer.
Vorkenntnisse
Informatik Grundstudium bzw. 30 absolvierte Credits des Masterstudiums
Angesprochener Hörendenkreis
Informatik Bachelor und Master, Math. NF Inf. Hauptstudium
Umfang
9 Wochen für Bachelor und 6 Monate für Master
Leistungsnachweis
In der Regel Implementierung, schriftliche Ausarbeitung, Vortrag und ein Poster
Veranstalter
Prof. Dr. Gerd Stumme, Mo Abdulla, Tobias Hille, Marcel Nöhre, Anurag Sharma