Vector space search engines that maximise expected user utility
by Nilgun Ferhatosmanoglu, Theodore T. Allen, Guadalupe Canahuate
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 3, 2009

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.

Online publication date: Tue, 31-Mar-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com