Home > Search Results: keywords:"Probabilistic graphical models"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Využití imsetů při učení bayesovských sítí
 Vomlel, Jiří ; Studený, Milan
This paper describes a modification of the greedy equivalence search (GES) algorithm. The presented modification is based on the algebraic approach to learning. The states of the search space are standard imsets. Each standard imset represents an equivalence class of Bayesian networks. For a given quality criterion the database is represented by the respective data imset. This allows a very simple update of a given quality criterion since the moves between states are represented by differential imsets. We exploit a direct characterization of lower and upper inclusion neighborhood, which allows an efficient search for the best structure in the inclusion neighborhood. The algorithm was implemented in R and is freely available.
Detailed record
Sborník třetího evropského workshopu o pravděpodobnostních grafických modelech
These are the proceedings of the third European workshop on Probabilistic Graphical Models (PGM’06) to held in Prague, Czech Republic, September 12-15, 2006. The aim of this series of workshops on probabilistic graphical models is to provide a discussion forum for researchers interested in this topic.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English