An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Using collaborative filtering to weave an information tapestry
Communications of the ACM - Special issue on information filtering
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
Modern Information Retrieval
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
Information Filtering: Overview of Issues, Research and Systems
User Modeling and User-Adapted Interaction
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Self-Adaptive User Profiles for Large-Scale Data Delivery
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Batched Processing for Information Filters
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Knowledge and Data Engineering
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
What Happened to Content-Based Information Filtering?
ICTIR '09 Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Collaborative filtering based on significances
Information Sciences: an International Journal
| Hi-index | 0.00 |
The traditional problem of similarity search requires to find, within a set of points, those that are closer to a query point q, according to a distance function d. In this paper we introduce the novel problem of metric information filtering (MIF): in this scenario, each point x"i comes with its own distance function d"i and the task is to efficiently determine those points that are close enough, according to d"i, to a query point q. MIF can be seen as an extension of both the similarity search problem and of approaches currently used in content-based information filtering, since in MIF user profiles (points) and new items (queries) are compared using arbitrary, personalized, metrics. We introduce the basic concepts of MIF and provide alternative resolution strategies aiming to reduce processing costs. Our experimental results show that the proposed solutions are indeed effective in reducing evaluation costs.