Complexity of Information Extraction

Complexity of Information Extraction

<p>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 decisi...

Full description

Bibliographic Details
Main Author: Abu-Mostafa, Yaser Said
Format: Others
Published: 1983
Online Access:https://thesis.library.caltech.edu/1786/4/abu-mostafa-ys_1983.pdf
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 <https://resolver.caltech.edu/CaltechETD:etd-05142003-111719>
id ndltd-CALTECH-oai-thesis.library.caltech.edu-1786
record_format oai_dc
spelling ndltd-CALTECH-oai-thesis.library.caltech.edu-17862020-07-15T07:09:31Z Complexity of Information Extraction Abu-Mostafa, Yaser Said <p>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.</p> 1983 Thesis NonPeerReviewed application/pdf https://thesis.library.caltech.edu/1786/4/abu-mostafa-ys_1983.pdf https://resolver.caltech.edu/CaltechETD:etd-05142003-111719 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 <https://resolver.caltech.edu/CaltechETD:etd-05142003-111719> https://thesis.library.caltech.edu/1786/
collection NDLTD
format Others
sources NDLTD
description <p>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.</p>
author Abu-Mostafa, Yaser Said
spellingShingle Abu-Mostafa, Yaser Said
Complexity of Information Extraction
author_facet Abu-Mostafa, Yaser Said
author_sort Abu-Mostafa, Yaser Said
title Complexity of Information Extraction
title_short Complexity of Information Extraction
title_full Complexity of Information Extraction
title_fullStr Complexity of Information Extraction
title_full_unstemmed Complexity of Information Extraction
title_sort complexity of information extraction
publishDate 1983
url https://thesis.library.caltech.edu/1786/4/abu-mostafa-ys_1983.pdf
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 <https://resolver.caltech.edu/CaltechETD:etd-05142003-111719>
work_keys_str_mv AT abumostafayasersaid complexityofinformationextraction
_version_ 1719325478123208704

Similar Items