Vector space search engines that maximise expected user utility (Q843406)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vector space search engines that maximise expected user utility |
scientific article; zbMATH DE number 5613394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vector space search engines that maximise expected user utility |
scientific article; zbMATH DE number 5613394 |
Statements
Vector space search engines that maximise expected user utility (English)
0 references
12 October 2009
0 references
Summary: 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.
0 references
DCA
0 references
discrete choice analysis
0 references
information retrieval
0 references
LSI
0 references
latent semantic indexing
0 references
vector space
0 references
search engines
0 references
dimensional weights
0 references
tuning
0 references
expected user utility
0 references
0.8587001
0 references
0 references
0.8341085
0 references