Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability.
Bin FuMing-Yang KaoLusheng WangPublished in: TAMC (2009)
Keyphrases
- sample complexity
- success probability
- special case
- lower bound
- upper bound
- pac learning
- vc dimension
- learning algorithm
- theoretical analysis
- learning problems
- sample size
- concept classes
- supervised learning
- uniform distribution
- pac learning model
- data sets
- expected cost
- generalization error
- active learning
- high dimensional
- data mining