{"id":5130,"date":"2019-02-05T09:01:02","date_gmt":"2019-02-05T08:01:02","guid":{"rendered":"https:\/\/www.kde.cs.uni-kassel.de\/?page_id=5130"},"modified":"2019-03-04T16:33:56","modified_gmt":"2019-03-04T15:33:56","slug":"b-arbeiten","status":"publish","type":"page","link":"https:\/\/www.kde.cs.uni-kassel.de\/en\/lehre\/ws2018-19\/arbeiten\/b-arbeiten","title":{"rendered":"Bachelor-, Diplom- und Masterarbeiten"},"content":{"rendered":"<h2>Bachelor-, Diplom- und Masterarbeiten<\/h2>\n<p><span style=\"color: #a3004e;\">Themen:<\/span><\/p>\n<p style=\"padding-left: 30px;\">Viele Aufgabenstellungen besch\u00e4ftigen sich mit der Implementierung verschiedener Komponenten in eines der Websysteme die am Fachgebiet betrieben werden &lt;!&#8211; des <a href=\"http:\/\/www.bibsonomy.org\">BibSonomy-Systems<\/a>&#8211;&gt; oder mit der Analyse der in solchen System vorhandenen Daten. <!--Ziel ist es im allgemeinen, die Nutzbarkeit des System durch Dienste mit Mehrwert zu erh\u00f6hen. --> Dar\u00fcber hinaus werden weitere Themen angeboten, die in der Regel einen inhaltlichen Bezug zu aktuellen Forschungsprojekten des Fachgebiets Wissensverarbeitung haben.<\/p>\n<p style=\"padding-left: 30px;\">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\u00e4hrend er bei Projektarbeiten auf der technischen Umsetzung liegt.<\/p>\n<p style=\"padding-left: 30px;\">Zu folgenden Themengebieten k\u00f6nnen wir Arbeiten anbieten; zu konkreten Themen k\u00f6nnen die jeweiligen Betreuer genauere Auskunft geben.<\/p>\n<p style=\"padding-left: 30px;\">(<a href=\"\/lehre\/ws2018-19\/arbeiten\/m-arbeiten\"><span style=\"color: #a3004e;\">M<\/span><\/a> = methodischer Schwerpunkt, <a href=\"\/lehre\/ws2018-19\/arbeiten\/t-arbeiten\"><span style=\"color: #a3004e;\">T<\/span><\/a> = technischer Schwerpunkt, <a href=\"\/lehre\/ws2018-19\/arbeiten\/b-arbeiten\"><span style=\"color: #a3004e;\">B<\/span><\/a> = als Bachelorarbeit m\u00f6glich, <a href=\"\/lehre\/ws2018-19\/arbeiten\/ma-arbeiten\"><span style=\"color: #a3004e;\">MA<\/span><\/a> = als Masterarbeit m\u00f6glich)<\/p>\n<p style=\"padding-left: 30px;\"><div class=\"post-list-layout\"><div class=\"listing-item\"><div class=\"content\">\n<h3>Drawing Line Diagrams through Sublattice Anchoring<\/h3>\n\n\n\n<p>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<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/noehre\" data-type=\"link\" data-id=\"https:\/\/www.kde.cs.uni-kassel.de\/noehre\">Marcel N\u00f6hre<\/a><\/p>\n\n\n\n<p><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3>A Doubly-Additive Extension of Freese&#8217;s Algorithm<\/h3>\n\n\n\n<p>Doubly-additive line diagrams define a concept&#8217;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&#8217;s lattice drawing algorithm by optimizing base vectors, rather than refining node positions directly.<\/p>\n\n\n\n<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/noehre\" data-type=\"link\" data-id=\"https:\/\/www.kde.cs.uni-kassel.de\/noehre\">Marcel N\u00f6hre<\/a><\/p>\n\n\n\n<p><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">The Lattice of Relations between Multiple Squares<\/h3>\n\n\n\n<p>\n  In the book <i>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<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hille\">Tobias Hille<\/a><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Formalizing Results of Formal Concept Analysis<\/h3>\n\n\n\n<p>\n  Formalization of a large number of definitions and theorems in Algebra, Number\n  Theory and Analysis in\n  the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Lean_(proof_assistant)\">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 &#8220;Basic Theorem on Concept\n  Lattices&#8221; (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 <a href=\"https:\/\/leanprover-community.github.io\/mathlib4_docs\/Mathlib\/Order\/Closure.html\">extending\n  existing ones<\/a>. We will aim to build\n  a <a href=\"https:\/\/github.com\/PatrickMassot\/leanblueprint\">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<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hille\">Tobias Hille<\/a><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Temporal Ordinal Motifs in Topic Models<\/h3>\n\n\n\n<p> 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.<\/p>\n\n\n\n<p>Informationen: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hirth\">Johannes Hirth<\/a><\/p><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Ordinal Motifs in Hierarchical Topic Models<\/h3>\n\n\n\n<p> 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.<\/p>\n\n\n\n<p>Informationen: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hirth\">Johannes Hirth<\/a><\/p><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Network Motifs in Topic Flow Networks<\/h3>\n\n\n\n<p>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.<\/p>\n\n\n\n<p>Informationen: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hirth\">Johannes Hirth<\/a><\/p><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Formal Concept Analysis mit Attribut und Objektordnungen<\/h3>\n\n\n\n<p>In dieser Arbeit untersuchen Sie, inwiefern sich die Theorie der formalen Begriffsanalyse auf den Fall \u00fcbertragen l\u00e4sst, dass wir eine lineare Ordnung auf den Attributen und den Objekten vorliegen haben. <\/p>\n\n\n\n<p>Das Ziel ist es, die in der FCA \u00fcblichen Ideen (Begriffe, Implikationen etc.) auf solche Datens\u00e4tze zu \u00fcbertragen und die Theorie mit Echtwelt-Datens\u00e4tzen zu evaluieren. <\/p>\n\n\n\n<p>Informationen: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/duerrschnabel\">Dominik D\u00fcrrschnabel<\/a><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Invariants of Formal Contexts<\/h3>\n\n\n\n<p>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. <\/p>\n\n\n\n<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hille\">Tobias Hille<\/a><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a><\/span><\/div><div class=\"listing-item\"><div class=\"content\">\n<h3 class=\"wp-block-heading\">Detecting Graphs in Images<\/h3>\n\n\n\n<p>\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  <br>Most (if not all) of the programming will be done in Python.\n<\/p>\n\n\n\n<p>Inquiries: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hille\">Tobias Hille<\/a><\/p>\n<\/div> <span class=\"category-display\"><span class=\"category-display-label\">Kategorien:<\/span> <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/allgemein\">Allgemein<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/bachelor\">Bachelorarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/master\">Masterarbeit<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/methodischer-schwerpunkt\">Methodischer Schwerpunkt<\/a>, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/category\/technischer-schwerpunkt\">Technischer Schwerpunkt<\/a><\/span><\/div><\/div><\/p>\n<p><span style=\"color: #a3004e;\"> Aufgabenstellung und Termin:<\/span><\/p>\n<p style=\"padding-left: 30px;\">nach Absprache mit dem jeweiligen Betreuer<\/p>\n<p><span style=\"color: #a3004e;\"> Vorkenntnisse:<\/span><\/p>\n<p style=\"padding-left: 30px;\">Informatik Grundstudium bzw. 30 absolvierte Credits des Masterstudiums<\/p>\n<p><span style=\"color: #a3004e;\"> Angesprochener Teilnehmerkreis:<\/span><\/p>\n<p style=\"padding-left: 30px;\">Bachelor-, Diplom- und Masterstudierende Informatik, Math. NF Inf. Hauptstudium<\/p>\n<p><span style=\"color: #a3004e;\"> Leistungsnachweis:<\/span><\/p>\n<p style=\"padding-left: 30px;\">in der Regel Implementierung, schriftliche Ausarbeitung und Vortrag<\/p>\n<p><span style=\"color: #a3004e;\">Umfang:<\/span><\/p>\n<p style=\"padding-left: 30px;\">9 Wochen f\u00fcr Bachelor, 3 Monate f\u00fcr Diplom I und 6 Monate f\u00fcr Master und Diplom II<\/p>\n<p><span style=\"color: #a3004e;\"> Veranstalter:<\/span><\/p>\n<p style=\"padding-left: 30px;\"><a href=\"\/stumme\"><u><span style=\"color: #0066cc;\">Prof. Dr. Gerd Stumme<\/span><\/u><\/a>, <a href=\"\/felde\"><u><span style=\"color: #0066cc;\">Master Math. Maximilian Felde<\/span><\/u><\/a>, <a href=\"\/hanika\"><u><span style=\"color: #0066cc;\">Dipl.-Math. Tom Hanika<\/span><\/u><\/a>, <a href=\"\/koyda\"><u><span style=\"color: #0066cc;\">Master Math. Maren Koyda<\/span><\/u><\/a>, <a href=\"\/schaefermeier\"><u><span style=\"color: #0066cc;\">Master Inform. Bastian Sch\u00e4fermeier<\/span><\/u><\/a>, <a href=\"\/schmidt\"><u><span style=\"color: #0066cc;\">Master Inform. Andreas Schmidt<\/span><\/u><\/a><\/p>\n<p><span style=\"color: #a3004e;\"><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Bachelor-, Diplom- und Masterarbeiten Themen: Viele Aufgabenstellungen besch\u00e4ftigen sich mit der Implementierung verschiedener Komponenten in eines der Websysteme die am Fachgebiet betrieben werden &lt;!&#8211; des BibSonomy-Systems&#8211;&gt; oder mit der Analyse der in solchen System vorhandenen<a class=\"moretag\" href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/blog\/2023\/09\/18\/detecting-graphs-in-images\"> Read more&hellip;<\/a><\/p>\n","protected":false},"author":8,"featured_media":0,"parent":4290,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-5130","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\/5130","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\/8"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=5130"}],"version-history":[{"count":2,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/5130\/revisions"}],"predecessor-version":[{"id":5319,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/5130\/revisions\/5319"}],"up":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/4290"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=5130"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}