Use of genetic algorithms in information retrieval: Adapting matching functions.
dc.contributor.author | Pathak, Praveen A. | |
dc.contributor.advisor | Gordon, Michael | |
dc.date.accessioned | 2016-08-30T18:05:06Z | |
dc.date.available | 2016-08-30T18:05:06Z | |
dc.date.issued | 2000 | |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9963871 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/132447 | |
dc.description.abstract | Information retrieval systems are complex in nature due to the interactions of document, query, and matching subsystems involved in the process of retrieval. Researchers have applied probabilistic, knowledge-based, and, more recently, artificial intelligence based techniques like neural networks and symbolic learning to this problem. Very few researchers have tried to use evolutionary algorithms like genetic algorithms (GA's). Previous attempts at using GA's have concentrated on modifying the document representations or modifying the query representations. In this research, we explore the possibility of applying GA's to adapt the matching functions used in retrieval. We have described a method where an overall matching function is achieved by combining the results of the individual matching functions. The weights associated with individual matching functions have been adapted using GA's. We tested the method on two document collections. Experiments on these collections suggest that a GA based matching function adaptation significantly improves retrieval performance compared to the performance obtained by the best individual matching function. We believe the promising outcomes of the GA based matching function adaptation merits continuing research. We briefly present possible areas of future research such as simultaneous adaptations of the three subsystems involved in retrieval, user profiling using this approach, and evolving new matching functions. | |
dc.format.extent | 141 p. | |
dc.language | English | |
dc.language.iso | EN | |
dc.subject | Adapting | |
dc.subject | Adaptive Algorithms | |
dc.subject | Genetic Algorithms | |
dc.subject | Information Retrieval | |
dc.subject | Matching Functions | |
dc.subject | Use | |
dc.title | Use of genetic algorithms in information retrieval: Adapting matching functions. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Applied Sciences | |
dc.description.thesisdegreediscipline | Artificial intelligence | |
dc.description.thesisdegreediscipline | Communication and the Arts | |
dc.description.thesisdegreediscipline | Computer science | |
dc.description.thesisdegreediscipline | Information science | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/132447/2/9963871.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.