National Repository of Grey Literature 6 records found  Search took 0.00 seconds. 
Rozklad pravděpodobnostních tabulek representujících boolovské funkce
Vomlel, Jiří
We apply tensor rank-one decompositionnto conditional probability tables representing Boolean functions. We present a numerical algorithm that can be used to find a minimal tensor rank-one decomposition together with the results of the experiments performed using the proposed algorithm. We pay special attention to a family of Boolean functions that are common in probabilistic models from practice - monotone and symmetric Boolean functions.
Perfektní posloupnosti: příspěvek ke studiu strukturálních vlastností modelů podmíněné nezávislosti
Kleiter, G. D. ; Jiroušek, Radim
The paper shows how the properties of perfect sequences can be employed in learning independence models. The concept of a sink - usually defined in directed graphs only - is generalized to essential graphs and perfect sequences. A method that finds the number of labelings of a given unlabeled essential graph is described. The impact with respect to structuring the model space and learning the structure of models is discussed.
O efektivním algoritmu pro marginalizaci v kompozicionálních modelech
Bína, V. ; Jiroušek, Radim
The paper presents the necessary theoretical background and a brief description of an effective algorithm for marginalization in multidimensional compositional models.
Rozhodovací systém pro porovnávání ceníků
Hamplová, H. ; Ivánek, J. ; Jiroušek, Radim ; Kroupa, Tomáš ; Lněnička, Radim ; Studený, Milan ; Vomlel, Jiří
A problem of price lists comparison is introduced. This task can be conceived as an instance of database mergingúor record linkageútechniques whose aim is to integrate possibly identical data coming from different sources and in different formats. We review some of the existing approaches and sketch a first prototype of the solution based on a simple string similarity measure.
Zobecnění klasických pravidel pro kombinování domněnkových funkcí
Daniel, Milan
The Dempster's rule, Yager's rule and Dubois-Prade's rule for belief functions combination are generalized to be aplicable to hyper-power sets from the DSm theory. A comparison of the rules with DMs rule of combination is presented.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.