Minimal join graph set synthesis proprietor possession cliques algorithm
Keywords:
algebraic Bayesian networks, secondary structure, machine learning, probabilistic graphical knowledge models, global structureAbstract
The effective minimal join graph set synthesis algorithm (of self-managing cliques)from a given maximal knowledge pattern set and two its improvements, each of which is actualized in an algorithm, exists, however there is no algorithm that implements the two improvements. The goal of the work is to designing a new algorithm that actualizes all known improvements of the basic algorithm, and thus, is the most effective one. Such an algorithm implementing suggested improvement is designed and correctness of its work is proven.algebraic Bayesian networksalgebraic Bayesian networksReferences
Published
2010-12-01
How to Cite
Filchenkov, A. (2010). Minimal join graph set synthesis proprietor possession cliques algorithm. SPIIRAS Proceedings, 4(15), 193-212. https://doi.org/10.15622/sp.15.10
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
