National Repository of Grey Literature 4 records found  Search took 0.00 seconds. 
Noisy-or classifier
Vomlel, Jiří
We discuss application of the noisy-or model to classification with large number of attributes. An example of such a task is categorization of text documents, where attributes are single words from the documents.
Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours
Studený, Milan
The topic of the paper is to characterize inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph. It is shown that every inclusion neighbour is uniquely described by a pair ([a,b],C) where [a,b] is a pair of distict nodes which is not an edge and C is a disjoint set of nodes. Given such [a,b] the collection of respective sets C is the union of two tufts. The least and maximal sets of these tufts can be read from the essential graph.

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