Vector space search engines that maximise expected user utility

Nilgun Ferhatosmanoglu, Theodore T. Allen and Guadalupe Canahuate

International Journal of Mathematics in Operational Research, 2009, vol. 1, issue 3, 279-302

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.

Keywords: DCA; discrete choice analysis; information retrieval; LSI; latent semantic indexing; vector space; search engines; dimensional weights; tuning; expected user utility. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=24287 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:1:y:2009:i:3:p:279-302

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().