Complexity of Information Extraction

Citation

Abu-Mostafa, Yaser Said (1983) Complexity of Information Extraction. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/FVKM-7J60. https://resolver.caltech.edu/CaltechETD:etd-05142003-111719

Abstract

This thesis describes a mathematical theory that interrelates the basic concepts of complexity, cost, information and reliability. The accessibility of information, as opposed to its availability, is characterized. Universal bounds for complexity distribution, implementation cost and decision reliability are estimated. These bounds give rise to a methodology for any consistent definition of a complexity measure. The basic notions of pattern recognition and information theory are directly related to computational complexity.

Item Type:	Thesis (Dissertation (Ph.D.))
Subject Keywords:	Electrical Engineering; Computer Science
Degree Grantor:	California Institute of Technology
Division:	Engineering and Applied Science
Major Option:	Electrical Engineering
Minor Option:	Computer Science
Awards:	Milton and Francis Clauser Doctoral Prize, 1983
Thesis Availability:	Public (worldwide access)
Research Advisor(s):	Psaltis, Demetri
Thesis Committee:	Psaltis, Demetri (chair) Kechris, Alexander S. McEliece, Robert J. Mead, Carver Posner, Edward C. Ryser, Herbert J. Wilson, Richard M.
Defense Date:	23 May 1983
Record Number:	CaltechETD:etd-05142003-111719
Persistent URL:	https://resolver.caltech.edu/CaltechETD:etd-05142003-111719
DOI:	10.7907/FVKM-7J60
Default Usage Policy:	No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:	1786
Collection:	CaltechTHESIS
Deposited By:	Imported from ETD-db
Deposited On:	14 May 2003
Last Modified:	14 Jul 2020 00:26

Thesis Files

Preview

PDF - Final Version
See Usage Policy.
2MB

Repository Staff Only: item control page