Multiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases
IEEE Transactions on Knowledge and Data Engineering
Fast Evaluation Techniques for Complex Similarity Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Multi-sensor Information Fusion by Query Refinement
VISUAL '02 Proceedings of the 5th International Conference on Recent Advances in Visual Information Systems
The Truth about Corel - Evaluation in Image Retrieval
CIVR '02 Proceedings of the International Conference on Image and Video Retrieval
QCluster: relevance feedback using adaptive clustering for content-based image retrieval
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating Refined Queries in Top-k Retrieval Systems
IEEE Transactions on Knowledge and Data Engineering
Relevance feedback using adaptive clustering for image similarity retrieval
Journal of Systems and Software
Learning the semantics of multimedia queries and concepts from a small number of examples
Proceedings of the 13th annual ACM international conference on Multimedia
Probabilistic information retrieval approach for ranking of database query results
ACM Transactions on Database Systems (TODS)
Query result ranking over e-commerce web databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Relevance and ranking in online dating systems
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Graph based query trimming algorithm for relational data semantic cache
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Exploiting correlation to rank database query results
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
The Farthest Spatial Skyline Queries
Information Systems
Pragmatic correlation analysis for probabilistic ranking over relational data
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The proposed approaches are independent of the refinement model used (e.g., QPM or QEX) and hence work for all models. Our first contribution is to generalize the notion of similarity queries and allow multiple query points in a query (referred to as multipoint queries). This generalization is necessary since refined queries cannot be always expressed as single point queries.We develop a k-NN algorithm that can handle multipoint queries and show that it performs significantly better than the naive approach (i.e. execute several single point queries using the 'single-point' k-NN algorithm and merge results). The second and the main problem we address is how to evaluate refined queries efficiently.