ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Adaptive search engines as discovery games: an evolutionary approach
Full text PdfPdf (206 KB)
Source International Conference on Mobile Computing and Multimedia archive
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia table of contents
Linz, Austria
WORKSHOP SESSION: UWA 2008 table of contents
Pages: 444-449  
Year of Publication: 2008
ISBN:978-1-60558-269-6
Authors
Alfredo Milani  University of Perugia, Perugia, Italy
Clement Leung  Hong Kong Baptist University, Hong Kong
Alice Chan  Hong Kong Baptist University, Hong Kong
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 69,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1497185.1497280
What is a DOI?

ABSTRACT

Adaptive search engines (ASE), used in the retrieval of multimedia objects adapt their behavior depending on the user feedback in order to eventually converge to the optimal answer. The adaptive architecture has been shown to improve the performance in case of multimedia objects retrieval, when pre-indexing techniques are costly or can be applied only partially. The continuous user feedbacks on the lists of returned objects are used to filter out irrelevant objects and promote the relevant ones. This work propose an original dealer/opponent game model for ASE. The system/user interactive process which takes place in ASE can be modeled as a discovery game between a dealer, the user community which holds a secret consisting in the optimal answer to a query, and an opponent, i.e. the system, which tries to discover the secret by submitting tentative solutions on which it receives the user/dealer feedback. It is shown how the complexity of the game can be related to known games. An evolutionary approach to solve the ASE game is also presented. Experimental results shows convergence to the optimal solution with acceptable performance for real domain size. The proposed schema is quite general and can fit other adaptive search architectures which appear in e-business and e-commerce applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
Shan-Tai Chen and Shun-Shii Lin. Optimal algorithms for 2 x n mastermind games---a graph-partition approach. The Computer Journal, 47(5):602--611, 2004.
 
4
5
 
6
7
8
 
9
Yashmeet Khopkar et al. Search engine personalization, an exploratory study. First Monday, 8(7), July 07 2003.
10
 
11
Michael J. Fischer and Rebecca N. Wright. R.n.: An application of game-theoretic techniques to cryptography. In Discrete Mathematics and Theoretical Computer Science 13, pages 99--118. American Mathematical Society, 1993.
 
12
Wayne Goddard. Static mastermind. J. Combin. Math. Combin. Comput., 47(1):225--236, 2003.
13
 
14
Eszter Hargittai. Do you "google"? understanding search engine use beyond the hype. First Monday, 9(3), March 01 2004.
15
 
16
Gillat Kol and Moni Naor. Cryptography and game theory: Designing protocols for exchanging information. TCC.
 
17
 
18
Maass and Nowak. Text indexing with errors. In CPM: 16th Symposium on Combinatorial Pattern Matching, 2005.
19
 
20
 
21
Alfredo Milani. Online genetic algorithms. In International Journal of Information Theories and Applications, volume 11, pages 20--28, 2004.
 
22
Shun-Shii Lin Shan-Tai Chen and Li-Te Huang. Exact-bound analyzes and optimal strategies for mastermind with a lie. LNCS, 4250:195--209, 2006.
 
23
 
24
Jeff Stuckman and Guo qiang Zhang. Mastermind is np-complete. INFOCOMP J. Comput. Sci, 5:25--28, 2006.

Collaborative Colleagues:
Alfredo Milani: colleagues
Clement Leung: colleagues
Alice Chan: colleagues