Query Refinement in Similarity Retrieval Systems

In many applications, users specify target values for certa in attributes/features without requiring exact matches to these values in return. Instead, the result is typically a ranked list of the top k objects that best match the specified feature values. User subjectiv ity is an important aspect of such queries, i.e., which objects are relevant to the user and which are not depends on the perception of the user. Due to the subjective nature of similarity-based retrieval, th e answers returned by the system to a user query often do not satisfy the user’s information need right away; either because the weights and the distance functions associated with the features do not accurately ca pture the user’s perception or because the specified target values do not fully capture her information need or both. The most commonly used technique to overcome this problem is query refinement. In th is technique, the user provides to the system some feedback on the “relevance” of the answers to the user’s query. The system then analyzes the feedback, refines the query (i.e., modifies the weights, dist ance functions, target values etc.) evaluates it and returns the new results. In this paper, we provide an over view of the techniques used to construct the refined query based on the feedback from the user as well as the tec niques to evaluate the refined query efficiently. We present experimental results demonstratin g the effectiveness of the techniques discussed in the paper.

[1]  Ilaria Bartolini,et al.  FeedbackBypass: A New Approach to Interactive Similarity Query Processing , 2001, VLDB.

[2]  Sharad Mehrotra,et al.  Efficient Query Refinement in Multimedia Databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[3]  Sharad Mehrotra,et al.  Query reformulation for content based multimedia retrieval in MARS , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[4]  Sharad Mehrotra,et al.  Similarity Search Using Multiple Examples in MARS , 1999, VISUAL.

[5]  Sharad Mehrotra,et al.  The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[6]  Ronald Fagin,et al.  Combining Fuzzy Information from Multiple Systems , 1999, J. Comput. Syst. Sci..

[7]  Thomas S. Huang,et al.  Supporting Ranked Boolean Similarity Queries in MARS , 1998, IEEE Trans. Knowl. Data Eng..

[8]  Christos Faloutsos,et al.  MindReader: Querying Databases Through Multiple Examples , 1998, VLDB.

[9]  Ronald Fagin,et al.  Fuzzy queries in multimedia database systems , 1998, PODS '98.

[10]  Thomas S. Huang,et al.  Supporting similarity queries in MARS , 1997, MULTIMEDIA '97.

[11]  Thomas S. Huang,et al.  Content-based image retrieval with relevance feedback in MARS , 1997, Proceedings of International Conference on Image Processing.

[12]  Hans-Peter Kriegel,et al.  Efficient User-Adaptable Similarity Search in Large Multimedia Databases , 1997, VLDB.

[13]  Christos Faloutsos,et al.  Fast Nearest Neighbor Search in Medical Image Databases , 1996, VLDB.

[14]  Amihai Motro,et al.  VAGUE: a user interface to relational databases that permits vague queries , 1988, TOIS.

[15]  K. Chakrabarti Query Reenement for Content Based Multimedia Retrieval in Mars , 1999 .

[16]  Raj Jain,et al.  Algorithms and strategies for similarity retrieval , 1996 .

[17]  John P. Oakley,et al.  Storage and Retrieval for Image and Video Databases , 1993 .