Metric index: An efficient and scalable solution for precise and approximate similarity search
Metric space is a universal and versatile model of similarity that can be applied in various
areas of information retrieval. However, a general, efficient, and scalable solution for metric …
areas of information retrieval. However, a general, efficient, and scalable solution for metric …
If-matching: Towards accurate map-matching with information fusion
With the advance of various location-acquisition technologies, a myriad of GPS trajectories
can be collected every day. However, the raw coordinate data captured by sensors often …
can be collected every day. However, the raw coordinate data captured by sensors often …
Modular service architectures: a concept and method for engineering IT services
T Bohmann, M Junginger… - 36th Annual Hawaii …, 2003 - ieeexplore.ieee.org
The demise of first generation service models of application service providers (ASP)
indicates that moving from individualized services (eg many outsourcing offerings) to fully …
indicates that moving from individualized services (eg many outsourcing offerings) to fully …
A probabilistic spell for the curse of dimensionality
Range searches in metric spaces can be very difficult if the space is “high dimensional”, ie
when the histogram of distances has a large mean and/or a small variance. This so-called …
when the histogram of distances has a large mean and/or a small variance. This so-called …
Metric index: An efficient and scalable solution for similarity search
Metric space as a universal and versatile model of similarity can be applied in various areas
of non-text information retrieval. However, a general, efficient and scalable solution for …
of non-text information retrieval. However, a general, efficient and scalable solution for …
Negative selection algorithm based on grid file of the feature space
C Wen, D Xiaoming, L Tao, Y Tao - Knowledge-Based Systems, 2014 - Elsevier
Negative selection algorithm (NSA) is an important algorithm for the generation of artificial
immune detectors. However, the randomly generated candidate detectors have to be …
immune detectors. However, the randomly generated candidate detectors have to be …
Approximate furthest neighbor in high dimensions
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by
applications in recommender systems, we consider approximate furthest neighbor (AFN) …
applications in recommender systems, we consider approximate furthest neighbor (AFN) …
Large-scale similarity data management with distributed metric index
Metric space is a universal and versatile model of similarity that can be applied in various
areas of non-text information retrieval. However, a general, efficient and scalable solution for …
areas of non-text information retrieval. However, a general, efficient and scalable solution for …
On locality-sensitive indexing in generic metric spaces
The concept of Locality-sensitive Hashing (LSH) has been successfully used for searching
in high-dimensional data and a number of locality-preserving hash functions have been …
in high-dimensional data and a number of locality-preserving hash functions have been …
[HTML][HTML] Counting distance permutations
M Skala - Journal of Discrete Algorithms, 2009 - Elsevier
Distance permutation indexes support fast proximity searching in high-dimensional metric
spaces. Given some fixed reference sites, for each point in a database the index stores a …
spaces. Given some fixed reference sites, for each point in a database the index stores a …