Pages that link to "Item:Q688817"
From MaRDI portal
The following pages link to A machine discovery from amino acid sequences by decision trees over regular patterns (Q688817):
Displaying 11 items.
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- U-shaped, iterative, and iterative-with-counter learning (Q1009263) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- The evolution of stochastic regular motifs for protein sequences (Q1396010) (← links)
- Decision lists over regular patterns. (Q1874229) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- Gold-Style Learning Theory (Q2963592) (← links)
- Parallelism Increases Iterative Learning Power (Q3520049) (← links)
- Inductive inference of unbounded unions of pattern languages from positive data (Q5915396) (← links)
- An approximation algorithm for alphabet indexing problem (Q6487939) (← links)