Absolute versus probabilistic classification in a logical setting
From MaRDI portal
Publication:924172
DOI10.1016/J.TCS.2008.02.026zbMath1147.68636OpenAlexW2108835697MaRDI QIDQ924172
Sanjay Jain, Eric Martin, Frank Stephan
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.026
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning with belief levels
- Probability and plurality for aggregations of learning machines
- On the relative sizes of learnable sets
- Classification using information
- Probabilistic language learning under monotonicity constraints
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Logic Programming
- A formal theory of inductive inference. Part I
- Probabilistic inductive inference: A survey
This page was built for publication: Absolute versus probabilistic classification in a logical setting