Scholars Central

Research articlePublished 10 Dec 2013

Bayesian network structure learning based on the chaotic particle swarm optimization algorithm

Authors: Q. Zhang, Z. Li, C.J. Zhou, X.P. Wei

Genetics and Molecular Research

Volume 12 · Issue 4 · Pages 4468–4479

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The Bayesian network (BN) is a knowledge representation form, which has been proven to be valuable in the gene regulatory network reconstruction because of its capability of capturing causal relationships between genes. Learning BN structures from a database is a nondeterministic polynomial time (NP)-hard problem that remains one of the most exciting challenges in machine learning. Several heuristic searching techniques have been used to find better network structures. Among these algorithms, the classical K2 algorithm is the most successful. Nonetheless, the performance of the K2 algorithm is greatly affected by a prior ordering of input nodes.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Genetics and Molecular Research.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalGenetics and Molecular Research
  • SubjectGenetics & Molecular Biology
  • BylineArticles whose byline prints “Q. Zhang”
  • BylineArticles whose byline prints “Z. Li”
  • BylineArticles whose byline prints “C.J. Zhou”
  • BylineArticles whose byline prints “X.P. Wei”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels