Bachelor-, Diplom- und Masterarbeiten
Themen:
Viele Aufgabenstellungen beschäftigen sich mit der Implementierung verschiedener Komponenten in eines der Websysteme die am Fachgebiet betrieben werden <!– des BibSonomy-Systems–> oder mit der Analyse der in solchen System 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 dem Studierenden; die Ausrichtung und der Umfang der Arbeit richtet 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.
(M = methodischer Schwerpunkt, T = technischer Schwerpunkt, B = als Bachelorarbeit möglich, MA = als Masterarbeit möglich)
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: Mohammad Abdulla
Formalizing Results of Formal Concept Analysis
Formalization of a large number of definitions and theorems in Algebra, Number Theory and Analysis in the lean prover brings the field of formal theorem proving to the forefront of mathematical research. However, mathematical notions and results from the field of Formal Concept Analysis are not yet included. Thus the goal of this project (or thesis) is to formally prove the “Basic Theorem on Concept Lattices” (or a comparable result) in order to provide a stepping stone in this direction. Essentially, this involves building core definitions and necessary preliminary results by extending existing ones. We will aim to build a lean blueprint and if you are only interested in a small project, we will find a reasonable partial realization to stop at.
Inquiries: Tobias Hille
Temporal Ordinal Motifs in Topic Models
Topic models are, often, dimension reduction techniques for large corpora of textual documents. A central aspect to these models is that they allow for text based explanations of the dimensions in the reduced space. A novel technique, called ordinal motifs, interpret and visualize these dimension hierarchically with respect to (ordinal) substructures of standard shape. With your work, you extent this technique towards ordinal motifs over time, develop visualization techniques, and show their applicability in a practical setting.
Informationen: Johannes Hirth
Ordinal Motifs in Hierarchical Topic Models
Topic models are, often, dimension reduction techniques for large corpora of textual documents. A central aspect to these models is that they allow for text based explanations of the dimensions in the reduced space. A novel technique, called ordinal motifs, interpret and visualize these dimension hierarchically with respect to (ordinal) substructures of standard shape. With your work, you extent this technique towards hierarchical topic models, define hierarchical motif structures, develop visualization techniques, and show their applicability in a practical setting.
Informationen: Johannes Hirth
Network Motifs in Topic Flow Networks
In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) a graph structure for the analysis of research topic flows between scientific authors and their respective research fields was proposed. With your work, you identify and interpret substructures that are integral to this network.
Informationen: Johannes Hirth
Formal Concept Analysis mit Attribut und Objektordnungen
In dieser Arbeit untersuchen Sie, inwiefern sich die Theorie der formalen Begriffsanalyse auf den Fall übertragen lässt, dass wir eine lineare Ordnung auf den Attributen und den Objekten vorliegen haben.
Das Ziel ist es, die in der FCA üblichen Ideen (Begriffe, Implikationen etc.) auf solche Datensätze zu übertragen und die Theorie mit Echtwelt-Datensätzen zu evaluieren.
Informationen: Dominik Dürrschnabel
Invariants of Formal Contexts
It is not easy to recognise whether two (reduced) formal contexts are isomorphic, or given a set of formal contexts, how many different formal contexts are contained there. One aid are invariants, i.e. derived quantities, that do not depend on the concrete representation of the formal context. Simple examples are the number of attributes of the context or the number of objects of the context. If two contexts have different values for an invariant, the contexts are not isomorphic. The aim is to examine formal contexts with regard to possible invariants. Formal contexts can be represented as bipartite graphs, therefore, known graph invariants in particular are to be considered.
Inquiries: Tobias Hille
Detecting Graphs in Images
The project aims to develop a machine learning model that can detect (simple) graphs in images.
This involves not only an extensive literature review but also gathering useful training data.
Moreover we need to train the model to recognize and segment images containing graphs.
The project will use image classification algorithms and techniques to achieve this goal.
Completing individual parts may already be enough for a successful conclusion.
You will build upon work done by previous participants.
Most (if not all) of the programming will be done in Python.
Inquiries: Tobias Hille
Decomposition of Concept Lattices
Conceptual structures are great hierarchical tools to analyze complex relations between data point. Recent approaches focus on identifying ordinal sub-structures of concept lattices that have specific shape, e.g., chains, cubes, cycles etc. The sub-structures are then used to derive highler level relations between data point or to explain the hierarchical structure. With your work, you study how this approach can be used to decompose concept lattices into sub-structures.
Informationen: Johannes Hirth
Stabilität von Formalen Kontexten
Wir nennen einen formalen Kontext stabil, wenn sich beim Setzen oder Entfernen jedes Kreuzes die Größe des Begriffsverbandes nicht verkleinert. Untersuchen Sie Echtweltdaten auf Stabilität und untersuchen Sie, inwiefern sich die Stabilität als Bewertungsmaß für intrinsisch sinnvolle Daten eignet.
Informationen: Dominik Dürrschnabel
Aufgabenstellung und Termin:
nach Absprache mit dem jeweiligen Betreuer
Vorkenntnisse:
Informatik Grundstudium bzw. 30 absolvierte Credits des Masterstudiums
Angesprochener Teilnehmerkreis:
Bachelor-, Diplom- und Masterstudierende Informatik, Math. NF Inf. Hauptstudium
Leistungsnachweis:
in der Regel Implementierung, schriftliche Ausarbeitung und Vortrag
Umfang:
9 Wochen für Bachelor, 3 Monate für Diplom I und 6 Monate für Master und Diplom II
Veranstalter:
Prof. Dr. Gerd Stumme, Master Math. Maximilian Felde, Dipl.-Math. Tom Hanika, Master Math. Maren Koyda, Master Inform. Bastian Schäfermeier, Master Inform. Andreas Schmidt