Accession Number : ADA560183


Title :   Resource-Bounded Information Acquisition and Learning


Descriptive Note : Doctoral thesis


Corporate Author : MASSACHUSETTS UNIV AMHERST DEPT OF COMPUTER SCIENCE


Personal Author(s) : Kanani, Pallika H


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a560183.pdf


Report Date : May 2012


Pagination or Media Count : 146


Abstract : In many scenarios it is desirable to augment existing data with information acquired from an external source. For example, information from the Web can be used to fill missing values in a database or to correct errors. In many machine learning and data mining scenarios, acquiring additional feature values can lead to improved data quality and accuracy. However, there is often a cost associated with such information acquisition, and we typically need to operate under limited resources. In this thesis, I explore different aspects of Resource-bounded Information Acquisition and Learning. The process of acquiring information from an external source involves multiple steps, such as deciding what subset of information to obtain, locating the documents that contain the required information, acquiring relevant documents, extracting the specific piece of information, and combining it with existing information to make useful decisions. The problem of Resource-bounded Information Acquisition (RBIA) involves saving resources at each stage of the information acquisition process. I explore four special cases of the RBIA problem, propose general principles for efficiently acquiring external information in real-world domains, and demonstrate their effectiveness using extensive experiments. For example, in some of these domains I show how interdependency between fields or records in the data can also be exploited to achieve cost reduction. Finally, I propose a general framework for RBIA, that takes into account the state of the database at each point of time, dynamically adapts to the results of all the steps in the acquisition process so far, as well as the properties of each step, and carries them out striving to acquire most information with least amount resources.


Descriptors :   *INFORMATION RETRIEVAL , *LEARNING MACHINES , COST BENEFIT ANALYSIS , DATA ACQUISITION , INTERNET , MARKOV PROCESSES , THESES


Subject Categories : Information Science
      Cybernetics


Distribution Statement : APPROVED FOR PUBLIC RELEASE