Počet záznamů: 1
Two basic problems of incremental construction in Formal Concept Analysis
Údaje o názvu Two basic problems of incremental construction in Formal Concept Analysis [rukopis] / Martin Kauer Další variantní názvy Formální konceptuální analýza Osobní jméno Kauer, Martin (autor diplomové práce nebo disertace) Vyd.údaje 2019 Fyz.popis 86 : il., grafy, tab. Poznámka Ved. práce Michal Krupka Dal.odpovědnost Krupka, Michal (vedoucí diplomové práce nebo disertace) Dal.odpovědnost Univerzita Palackého. Katedra informatiky (udelovatel akademické hodnosti) Klíč.slova formal concept analysis * concept lattice construction * incremental algorithms * incidence removal * preconcept removal * substructures of concept lattices * generated complete sublattices * semi-closed subrelations * interval-preconcepts * basic theorem * formal concept analysis * concept lattice construction * incremental algorithms * incidence removal * preconcept removal * substructures of concept lattices * generated complete sublattices * semi-closed subrelations * interval-preconcepts * basic theorem Forma, žánr disertace dissertations MDT (043.3) Země vyd. Česko Jazyk dok. angličtina Druh dok. PUBLIKAČNÍ ČINNOST Titul Ph.D. Studijní program Doktorský Studijní program Informatika Studijní obor Informatika kniha
Kvalifikační práce Staženo Velikost datum zpřístupnění 00213906-477199974.pdf 41 1.2 MB 02.01.2019 Posudek Typ posudku 00213906-ved-176369560.pdf Posudek vedoucího 00213906-opon-343296322.pdf Posudek oponenta Průběh obhajoby datum zadání datum odevzdání datum obhajoby přidělená hodnocení typ hodnocení 00213906-prubeh-169925831.pdf 01.01.2012 02.01.2019 03.05.2019 S 2
Formal Concept Analysis (FCA) is a field of applied mathematics based on formalization of the notion of concept from cognitive psychology and has been widely studied in the last several decades. From a description of objects by their features FCA derives a hierarchy of concepts which is formalized by a complete lattice called a concept lattice. We explore some fundamental aspects of FCA. First, we focus on incremental concept lattice construction and analysis of its basic step, removal of an incidence, and propose two algorithms for incremental concept lattice construction. Second, we study generated complete sublattices and show how their corresponding closed subrelations can be efficiently computed. Lastly, we investigate a new type of subrelations from which a new formal rectangle type arises, we provide motivation from cognitive psychology for it and propose a basic theorem for lattices of such rectangles.Formal Concept Analysis (FCA) is a field of applied mathematics based on formalization of the notion of concept from cognitive psychology and has been widely studied in the last several decades. From a description of objects by their features FCA derives a hierarchy of concepts which is formalized by a complete lattice called a concept lattice. We explore some fundamental aspects of FCA. First, we focus on incremental concept lattice construction and analysis of its basic step, removal of an incidence, and propose two algorithms for incremental concept lattice construction. Second, we study generated complete sublattices and show how their corresponding closed subrelations can be efficiently computed. Lastly, we investigate a new type of subrelations from which a new formal rectangle type arises, we provide motivation from cognitive psychology for it and propose a basic theorem for lattices of such rectangles.
Počet záznamů: 1