Title :
On summarizing data using probabilistic assertions
fDate :
7/1/1977 12:00:00 AM
Abstract :
The complexity of question-answering systems which are permitted to submit probabilistic estimates of the truth of certain propositions is considered. Bounds are derived on the expected memory space and computational work required to produce probabilistic estimates of a specified quality. The general features of the bounds are similar to those of question-answering systems constrained to true-false type answers.
Keywords :
Memories; Probability; Rate-distortion theory; Computational complexity; Data structures; Feature extraction; Helium; Laboratories; Mathematics; Multidimensional systems; Pattern recognition; Psychology; Rain;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055756
