Počet záznamů: 1
A new perspective on the Close-by-One algorithm
Údaje o názvu A new perspective on the Close-by-One algorithm [rukopis] / Radek Janoštík Další variantní názvy A new perspective on the Close-by-One algorithm Osobní jméno Janoštík, Radek (autor diplomové práce nebo disertace) Překl.náz A new perspective on the Close-by-One algorithm Vyd.údaje 2021 Fyz.popis 92 : il., grafy, schémata, tab. Poznámka Ved. práce Jan Konečný Dal.odpovědnost Konečný, Jan (vedoucí diplomové práce nebo disertace) Dal.odpovědnost Univerzita Palackého. Katedra informatiky (udelovatel akademické hodnosti) Klíč.slova formal concept analysis * Close-by-One * non-redundancy * attribute implications * minimalization * LCM * frequent closed itemset * logical analysis of data * hypothesis generation * formal concept analysis * Close-by-One * non-redundancy * attribute implications * minimalization * LCM * frequent closed itemset * logical analysis of data * hypothesis generation Forma, žánr disertace dissertations MDT (043.3) Země vyd. Česko Jazyk dok. češ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í 00274808-711439162.zip 17 1.1 MB 17.02.2021 Posudek Typ posudku 00274808-ved-639727138.pdf Posudek vedoucího 00274808-opon-187813540.pdf Posudek oponenta Průběh obhajoby datum zadání datum odevzdání datum obhajoby přidělená hodnocení typ hodnocení 00274808-prubeh-797863149.pdf 26.04.2018 17.02.2021 13.05.2021 S Hodnocení známkou
The Close-by-One (CbO) algorithm is a well-known algorithm used in Formal Concept Analysis (FCA). We shed a new light on CbO: First, we propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines CbO and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Second, we describe LCM, an algorithm for enumeration of frequent closed itemsets in transaction databases, in terms of FCA and show that LCM is basically the CbO algorithm with multiple speed-up features for processing sparse data. Third, we show that FCA and Logical Analysis of Data (LAD) utilize the same basic building blocks, which enable us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in LAD using algorithms of FCA.The Close-by-One (CbO) algorithm is a well-known algorithm used in Formal Concept Analysis (FCA). We shed a new light on CbO: First, we propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines CbO and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Second, we describe LCM, an algorithm for enumeration of frequent closed itemsets in transaction databases, in terms of FCA and show that LCM is basically the CbO algorithm with multiple speed-up features for processing sparse data. Third, we show that FCA and Logical Analysis of Data (LAD) utilize the same basic building blocks, which enable us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in LAD using algorithms of FCA.
Počet záznamů: 1