Vector space search engines that maximise expected user utility. (16th April 2009)

• Record Type: Journal Article
• Authors: Ferhatosmanoglu, Nilgun; Allen, Theodore T.; Canahuate, Guadalupe
• Is Part Of: International journal of mathematics in operational research. Volume 1:Number 3(2009)
• Page Start: 279
• Page End: 302
• Publication Date: 2009-04-16
• Subjects: DCA -- discrete choice analysis -- information retrieval -- LSI -- latent semantic indexing -- vector space -- search engines -- dimensional weights -- tuning -- expected user utility; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

Abstract

Vector space methods are perhaps the most widely studied type of search engine. Yet, these search engines are generally not optimal in the sense that the search results are based on the current query and the available database without considering information about the user preferences. This article establishes a rigorous relationship between the tuning of dimensional weights and the maximisation of the expected utilities of users. The methods can be implemented using standard software for discrete choice analysis and readily available data. The proposed methodology is called 'discrete choice analysis weighting' (DCAW). The test-bed evaluation of DCAW conducted on around 10, 000 news data offers promising results for further studies. Also, several opportunities for future research are proposed.