
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24October 26
ISBN: 081860591X
ASCII Text  x  
L. Pitt, "A Characterization Of Probabilistic Inference," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 485494, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984.  
BibTex  x  
@article{ 10.1109/SFCS.1984.715951, author = {L. Pitt}, title = {A Characterization Of Probabilistic Inference}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1984}, isbn = {081860591X}, pages = {485494}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715951}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  A Characterization Of Probabilistic Inference SN  081860591X SP485 EP494 A1  L. Pitt, PY  1984 VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
Inductive Inference Machines (IlMs) attempt to identify functions given only inputoutput pairs of the functions. Probabilistic IlMs are defined, as is the probability that a probabilistic IlM identifies a function with respect to two common identification criteria: EX and BC. Let ID denote either of these criteria. Then ID/sub prob/(p) is the family of sets of functions U for which there is a probabilistic IlM identifying every f /spl epsi/ U with probability /spl ges/ p. It is shown that for all positive integers n, ID/sub prob/(1/n) is properly contained in ID/sub prob/(1/(n+1)), and that this discrete hierarchy is the "finest" possible. This hierarchy is related to others in the literature.
Citation:
L. Pitt, "A Characterization Of Probabilistic Inference," focs, pp.485494, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.