On aggregating teams of learning machines
From MaRDI portal
Publication:1367526
DOI10.1016/0304-3975(94)00162-CzbMATH Open0884.68103OpenAlexW2153185970MaRDI QIDQ1367526FDOQ1367526
Publication date: 29 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00162-c
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Power of Vacillation in Language Learning
- Criteria of language learning
- Title not available (Why is that?)
- Language identification in the limit
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- Comparison of identification criteria for machine inductive inference
- Gödel numberings of partial recursive functions
- Computational limits on team identification of languages
- Probability and plurality for aggregations of learning machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Aggregating inductive expertise
- Title not available (Why is that?)
Cited In (3)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Probability and plurality for aggregations of learning machines 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Sharing in teams of heterogeneous, collaborative learning agents 👍 👎
- Hierarchies of probabilistic and team FIN-learning 👍 👎
- Learning, matching, and aggregation 👍 👎
This page was built for publication: On aggregating teams of learning machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367526)
