Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Proceedings of the eleventh annual symposium on Computational geometry
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
ACM Computing Surveys (CSUR)
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
Benchmarking Multimedia Databases
Multimedia Tools and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Approximate similarity retrieval with M-trees
The VLDB Journal — The International Journal on Very Large Data Bases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Improving approximate matching capabilities for Meta Map Transfer applications
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Retrieval quality vs. effectiveness of specificity-oriented search in XML collections
Information Retrieval
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Approximate similarity search in metric spaces using inverted files
Proceedings of the 3rd international conference on Scalable information systems
Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
Finding the K highest-ranked answers in a distributed network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
Building a web-scale image similarity search system
Multimedia Tools and Applications
Image indexing and retrieval using visual terms and text-like weighting
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
An approach to content-based image retrieval based on the Lucene search engine library
ECDL'10 Proceedings of the 14th European conference on Research and advanced technology for digital libraries
Approximate similarity search using samples
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
A native XML database supporting approximate match search
ECDL'05 Proceedings of the 9th European conference on Research and Advanced Technology for Digital Libraries
Similarity grid for searching in metric spaces
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Self-organising hierarchical retrieval in a case-agent system
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Polyphasic metric index: reaching the practical limits of proximity searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
Similarity search structures for metric data typically bound object partitions by ball regions. Since regions can overlap, a relevant issue is to estimate the proximity of regions in order to predict the number of objects in the regions' intersection. This paper analyzes the problem using a probabilistic approach and provides a solution that effectively computes the proximity through realistic heuristics that only require small amounts of auxiliary data. An extensive simulation to validate the technique is provided. An application is developed to demonstrate how the proximity measure can be successfully applied to the approximate similarity search. Search speedup is achieved by ignoring data regions whose proximity to the query region is smaller than a user-defined threshold. This idea is implemented in a metric tree environment for the similarity range and "nearest neighbors" queries. Several measures of efficiency and effectiveness are applied to evaluate proposed approximate search algorithms on real-life data sets. An analytical model is developed to relate proximity parameters and the quality of search. Improvements of two orders of magnitude are achieved for moderately approximated search results. We demonstrate that the precision of proximity measures can significantly influence the quality of approximated algorithms.