Library Open Repository
Refining Search Queries From Examples Using Boolean Expressions and Latent Semantic Analysis
Johnson, D and Malhotra, V and Vamplew, P and Patro, S (2004) Refining Search Queries From Examples Using Boolean Expressions and Latent Semantic Analysis. In: AISAT2004: International Conference on Artificial Intelligence in Science and Technology, 21-25 November 2004, Hobart, Tasmania, Australia.
AISAT-SearchQue...pdf | Download (240kB)
Available under University of Tasmania Standard License.
This paper describes an algorithm whereby an initial, naive user query to a search engine can be subsequently refined to improve both its recall and precision. This is achieved by manually classifying the documents retrieved by the original query into relevant and irrelevant categories, and then finding additional Boolean terms which successfully discriminate between these categories. Latent semantic analysis is used to weight the choice of these extra search terms to make the resulting queries more intuitive to users.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||World Wide Web, search engines, search query|
|Page Range:||pp. 120-125|
|Date Deposited:||26 Nov 2004|
|Last Modified:||18 Nov 2014 03:10|
|Item Statistics:||View statistics for this item|
Repository Staff Only (login required)
|Item Control Page|