Login / Signup
A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data.
Theodore J. Perkins
Michael T. Hallett
Published in:
IEEE ACM Trans. Comput. Biol. Bioinform. (2010)
Keyphrases
</>
sample complexity
learning algorithm
learning problems
computational complexity
learning process
supervised learning
theoretical analysis
active learning
boolean networks
special case
learning tasks
upper bound
machine learning algorithms
markov random field
reinforcement learning
training data
feature selection