The Use of Dynamic Contexts to Improve Casual Internet Searching
Document Type
Article
Department
Information Systems and Technology (CGU)
Publication Date
7-2003
Disciplines
Computer Sciences | Databases and Information Systems
Abstract
Research has shown that most users' online information searches are suboptimal. Query optimization based on a relevance feedback or genetic algorithm using dynamic query contexts can help casual users search the Internet. These algorithms can draw on implicit user feedback based on the surrounding links and text in a search engine result set to expand user queries with a variable number of keywords in two manners. Positive expansion adds terms to a user's keywords with a Boolean "and," negative expansion adds terms to the user's keywords with a Boolean "not." Each algorithm was examined for three user groups, high, middle, and low achievers, who were classified according to their overall performance. The interactions of users with different levels of expertise with different expansion types or algorithms were evaluated. The genetic algorithm with negative expansion tripled recall and doubled precision for low achievers, but high achievers displayed an opposed trend and seemed to be hindered in this condition. The effect of other conditions was less substantial.
Rights Information
© 2003 AMC Inc.
Terms of Use & License Information
Recommended Citation
G. Leroy, A. Lally, and H. Chen. “The Use of Dynamic Contexts to Improve Casual Internet Searching,” ACM Transactions on Information Systems (ACM -TOIS), vol. 21 (3), pp 229-253, July 2003.
