Die Abschlussarbeiten haben stets einen inhaltlichen Bezug zu aktuellen Forschungsprojekten des Fachgebiets Wissensverarbeitung.<\/p>\n\n\n\n
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\u00e4hrend er bei Projektarbeiten auf der technischen Umsetzung liegt.<\/p>\n\n\n\n
Zu folgenden Themengebieten k\u00f6nnen wir Arbeiten anbieten; zu konkreten Themen k\u00f6nnen die jeweiligen Betreuer genauere Auskunft geben:<\/p>\n\n\n
Structural patterns such as n-dimensional cubes, diamonds (M3\u200b), or pentagons (N5\u200b) 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.<\/p>\n\n\n\n
Inquiries: Marcel N\u00f6hre<\/a><\/p>\n\n\n\n <\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Bachelorarbeit<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a><\/span><\/div> 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.<\/p>\n\n\n\n Inquiries: Marcel N\u00f6hre<\/a><\/p>\n\n\n\n <\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Bachelorarbeit<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a><\/span><\/div> \n In the book Conceptual Exploration<\/i> by Ganter and Obiedkov (2016),\n Section 4.2.2 gives the example of exploring the different ways of arranging\n two squares in two dimensions. Later, in Section 6.1.1, the authors also consider\n part of the problem for the case of three squares. In this mostly theoretical\n project or thesis, we want to consider the complete case of three squares and, if\n possible, compute the lattice for the general four square setting.\n<\/p>\n\n\n\n Inquiries: Tobias Hille<\/a><\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Bachelorarbeit<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a><\/span><\/div> In the Birkhoff completion<\/a>, 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<\/strong> as a method for addressing inconsistencies<\/strong> that arise in lattice structures generated through the Birkhoff completion of non-distributive lattices.<\/p>\n\n\n\n Inquiries: Mo Abdulla<\/a><\/p>\n\n\n\n <\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a><\/span><\/div> \n Formalization of a large number of definitions and theorems in Algebra, Number\n Theory and Analysis in\n the lean\n prover<\/a> brings the field of formal theorem proving to the forefront of\n mathematical research. However, mathematical notions and results from the\n field of Formal Concept Analysis are not yet included. Thus, the goal of this\n project (or thesis) is to formally prove the “Basic Theorem on Concept\n Lattices” (or a comparable result), in order to provide a stepping stone in\n this direction. Essentially, this involves building core definitions and\n necessary preliminary results\n by extending\n existing ones<\/a>. We will aim to build\n a lean blueprint<\/a>\n and if you are only interested in a small project, we will find a reasonable\n partial realization to stop at.\n<\/p>\n\n\n\n Inquiries: Tobias Hille<\/a><\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Bachelorarbeit<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a>, Technischer Schwerpunkt<\/a><\/span><\/div> \n The project aims to develop a machine learning model that can detect (simple) graphs in images.\n This involves not only an extensive literature review but also gathering useful training data.\n Moreover, we need to train the model to recognize and segment images containing graphs.\n The project will use image classification algorithms and techniques to achieve this goal.\n Completing individual parts may already be enough for a successful conclusion.\n You will build upon work done by previous participants.\n Inquiries: Tobias Hille<\/a><\/p>\n<\/div> Kategorien:<\/span> Allgemein<\/a>, Bachelorarbeit<\/a>, Masterarbeit<\/a>, Methodischer Schwerpunkt<\/a>, Technischer Schwerpunkt<\/a><\/span><\/div><\/div>\n\n\n\n Sprechen Sie uns gern zu weiteren Themen an.\nInformationen zu den einzelnen Themen geben Ihnen gerne vorab die Betreuer.\n<\/p>\n\n\n\n Nach Absprache mit dem jeweiligen Betreuer.<\/p>\n\n\n\n Informatik Grundstudium bzw. 30 absolvierte Credits des Masterstudiums<\/p>\n\n\n\n Informatik Bachelor und Master, Math. NF Inf. Hauptstudium<\/p>\n\n\n\n 9 Wochen f\u00fcr Bachelor und 6 Monate f\u00fcr Master<\/p>\n\n\n\n In der Regel Implementierung, schriftliche Ausarbeitung und Vortrag<\/p>\n\n\n\n Prof. Dr. Gerd Stumme<\/a>, Mo Abdulla<\/a>, Tobias Hille<\/a>, Marcel N\u00f6hre<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" Bachelor- und Masterarbeiten Themen Die Abschlussarbeiten haben stets einen inhaltlichen Bezug zu aktuellen Forschungsprojekten des Fachgebiets Wissensverarbeitung. Die Themenstellung erfolgt in Absprache mit den Studierenden; die Ausrichtung und der Umfang der Arbeit richten sich nach Read more…<\/a><\/p>\n","protected":false},"author":15,"featured_media":0,"parent":10413,"menu_order":32,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-10414","page","type-page","status-publish","hentry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10414","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=10414"}],"version-history":[{"count":1,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10414\/revisions"}],"predecessor-version":[{"id":10458,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10414\/revisions\/10458"}],"up":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10413"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=10414"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}A Doubly-Additive Extension of Freese’s Algorithm<\/h3>\n\n\n\n
The Lattice of Relations between Multiple Squares<\/h3>\n\n\n\n
The Truncated Birkhoff Completion<\/h3>\n\n\n\n
Formalizing Results of Formal Concept Analysis<\/h3>\n\n\n\n
Detecting Graphs in Images<\/h3>\n\n\n\n
Most (if not all) of the programming will be done in Python.\n<\/p>\n\n\n\nAufgabenstellung und Termin<\/h3>\n\n\n\n
Vorkenntnisse<\/h3>\n\n\n\n
Angesprochener H\u00f6rendenkreis<\/h3>\n\n\n\n
Umfang<\/h3>\n\n\n\n
Leistungsnachweis<\/h3>\n\n\n\n
Veranstalter<\/h3>\n\n\n\n