Improved time complexities for learning boolean networks
Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions. Some recent studies propose more efficient methods with O(N · n2) time compl...
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Journal Article |
| 语言: | English |
| 出版: |
2014
|
| 主题: | |
| 在线阅读: | https://hdl.handle.net/10356/101312 http://hdl.handle.net/10220/18392 |