Explaining and Visualizing Structural Knowledge in Bipartite Graphs
| dc.date.accessioned | 2023-06-22T08:21:04Z | |
| dc.date.available | 2023-06-22T08:21:04Z | |
| dc.date.issued | 2023 | |
| dc.identifier | doi:10.17170/kobra-202306048157 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/14847 | |
| dc.language.iso | eng | |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Bipartite Graphs | eng |
| dc.subject | Formal Concept Analysis | eng |
| dc.subject | Artificial Intelligence | eng |
| dc.subject | Knowledge Discovery | eng |
| dc.subject | Structural Knowledge | eng |
| dc.subject | Machine Learning | eng |
| dc.subject | Graph Drawing | eng |
| dc.subject | Substructure Discovery | eng |
| dc.subject | Vector Space Embeddings | eng |
| dc.subject.ddc | 004 | |
| dc.title | Explaining and Visualizing Structural Knowledge in Bipartite Graphs | eng |
| dc.type | Dissertation | |
| dcterms.abstract | Bipartite graphs are an important model for the representation and analysis of relationships between two different types of entities. Datasets in this form are commonly found in many fields, such as social networks, biology, and economics. Formal concept analysis is a research approach that allows for the analysis of such bipartite graphs by clustering the data into so-called concepts and ordering those in a lattice structure. In this thesis we propose multiple approaches for the extraction and visualization of structural knowledge from bipartite graphs. To this end, knowledge is presented as easily explainable substructures that appear in the dataset. We address the question, how to extract some of these substructures which provide insight into the information underlying the data. For this purpose, we consider several substructures such as contranominal scales and ordinal scales and provide algorithms on how to discover them. Furthermore, we tackle the visualization problem that is inherent to formal concept analysis. In formal concept analysis, the primary tool to visualize knowledge is the hierarchy of concepts which, even though it is unambiguously defined, can be represented by many different diagrams that entail the same information but are to a different degree readable. We provide two ways to compute human-readable drawings, one of them is inspired by techniques from graph drawing and the other is heavily related to the structural investigations that we performed before. Finally, we investigate the question, whether it is possible to embed formal concepts into a low-dimensional vector space to enhance tasks in formal concept analysis. Thereby, we present an algorithm for embedding formal concepts by learning the closure operator using a neural network architecture. This is inspired from the word2vec approach which was developed in the field of natural language processing. We demonstrate its potential in that regard as we are able to rediscover conceptual features in the computed embeddings. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Dürrschnabel, Dominik | |
| dcterms.dateAccepted | 2023-05-24 | |
| dcterms.extent | xiv, 191 Seiten | |
| dc.contributor.corporatename | Kassel, Universität Kassel, Fachbereich Elektrotechnik/Informatik | ger |
| dc.contributor.referee | Stumme, Gerd (Prof. Dr.) | |
| dc.contributor.referee | Rudolph, Sebastian (Prof. Dr.) | |
| dc.subject.swd | Bipartiter Graph | ger |
| dc.subject.swd | Künstliche Intelligenz | ger |
| dc.subject.swd | Maschinelles Lernen | ger |
| dc.subject.swd | Wissensextraktion | ger |
| dc.subject.swd | Vektorraum | ger |
| dc.type.version | publishedVersion | |
| kup.iskup | false | |
| ubks.epflicht | true |
Dateien zu dieser Ressource
Das Dokument erscheint in:
-
Dissertationen [11]
Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: Attribution-NonCommercial-NoDerivatives 4.0 International