| dc.date.accessioned | 2023-08-01T11:17:56Z | |
| dc.date.available | 2023-08-01T11:17:56Z | |
| dc.date.issued | 2023 | |
| dc.identifier | doi:10.17170/kobra-202307148371 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/14959 | |
| dc.language.iso | eng | |
| dc.rights | Urheberrechtlich geschützt | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject | Formale Begriffsanalyse | ger |
| dc.subject | Datenreduktion | ger |
| dc.subject.ddc | 004 | |
| dc.title | Investigation and Elimination of Substructures in Formal Concept Analysis focusing on Boolean Suborders and Subcontexts | eng |
| dc.type | Dissertation | |
| dcterms.abstract | In the field of Formal Concept Analysis, data is mainly presented in so-called formal contexts, which assign to a set of objects their respective attributes. From those concept lattices can be generated, where the objects are grouped with respect to their common attributes to represent the relationships in the data in a way that enhances the understandability for humans. However, since a concept lattice can be of exponential size compared to its associated formal context, the presented relationships often become hard to grasp, even for data sets of moderate size. Therefore, the question arises of finding ways to reduce the size of a dataset to make it more understandable to the user while retaining the original information and structures as best as possible.
Since Boolean substructures are significantly responsible for the exponential size of concept lattices, whereas the objects in these structures just slightly differ concerning their attribute set, we consider them first in the present work. We give the possibility to infer from a Boolean subcontext in the formal context directly to a corresponding Boolean suborder in the associated concept lattice and vice versa. Next, we deal with reducing the size of the concept lattice. To this end, we consider two different types of feature selection in the formal context. Finally, we consider changes directly in the lattice. First, we give a way to collapse intervals (and thus Boolean suborders) by factorization while preserving (as many as possible of) the remaining elements. Second, we investigate under which conditions an interval can be entirely removed without changing anything in the rest of the structure. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Koyda, Maren | |
| dcterms.dateAccepted | 2023-07-12 | |
| dcterms.extent | xii, 140 Seiten | |
| dc.contributor.corporatename | Kassel, Universität Kassel, Fachbereich Elektrotechnik / Informatik | |
| dc.contributor.referee | Stumme, Gerd (Prof. Dr.) | |
| dc.contributor.referee | Ganter, Bernhard (Prof. Dr.) | |
| dc.subject.swd | Datenkompression | ger |
| dc.subject.swd | Formale Begriffsanalyse | ger |
| dc.type.version | publishedVersion | |
| kup.iskup | false | |
| ubks.epflicht | true | |
