scientific article; zbMATH DE number 437556
From MaRDI portal
Publication:3140435
Recommendations
Cited in
(63)- Efficient image retrieval through vantage objects
- LVA-index: An efficient way to determine nearest neighbors
- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective
- On a nearest-neighbor problem under Minkowski and power metrics for large data sets
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
- scientific article; zbMATH DE number 1865433 (Why is no real title available?)
- A parallel computing framework for big data
- Distance-based index structures for fast similarity search
- Fast neighbor search by using revised k-d tree
- scientific article; zbMATH DE number 1893569 (Why is no real title available?)
- Parallel query processing on distributed clustering indexes
- Some approaches to improve tree-based nearest neighbour search algorithms
- scientific article; zbMATH DE number 2050893 (Why is no real title available?)
- Multilabel classification with meta-level features in a learning-to-rank framework
- scientific article; zbMATH DE number 2065608 (Why is no real title available?)
- scientific article; zbMATH DE number 2065609 (Why is no real title available?)
- scientific article; zbMATH DE number 2065611 (Why is no real title available?)
- scientific article; zbMATH DE number 2066190 (Why is no real title available?)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information
- Pivot selection: dimension reduction for distance-based indexing
- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
- Randomized approaches for nearest neighbor search in metric space when computing the pairwise distance is extremely expensive
- Counting distance permutations
- A reverse nearest neighbor search algorithm in metric space
- ForestDSH: a universal hash design for discrete probability distributions
- Varying similarity metrics in visual information retrieval
- scientific article; zbMATH DE number 1559576 (Why is no real title available?)
- Kinetic and dynamic data structures for closest pair and all nearest neighbors
- Accelerating Fourier-Motzkin elimination using bit pattern trees
- An indexing-based approach to pattern and video clip recognition
- Detecting phase transitions in collective behavior using manifold's curvature
- scientific article; zbMATH DE number 7051199 (Why is no real title available?)
- A scalable re-ranking method for content-based image retrieval
- Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths
- Random projection-based auxiliary information can improve tree-based nearest neighbor search
- A distributed kernel summation framework for general‐dimension machine learning
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
- Search Space Reductions for Nearest-Neighbor Queries
- scientific article; zbMATH DE number 78497 (Why is no real title available?)
- Exploiting distance coherence to speed up range queries in metric indexes
- Deferred data structure for the nearest neighbor problem
- Fusing vantage point trees and linear discriminants for fast feature classification
- Memory-adaptative dynamic spatial approximation trees.
- Guidelines for RBF-FD discretization: numerical experiments on the interplay of a multitude of parameter choices
- Probabilistic analysis of vantage point trees
- An Index Data Structure for Searching in Metric Space Databases
- Towards privacy-preserving category-aware POI recommendation over encrypted LBSN data
- scientific article; zbMATH DE number 1983224 (Why is no real title available?)
- A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing
- Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces
- scientific article; zbMATH DE number 1930136 (Why is no real title available?)
- Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
- Dual‐tree fast exact max‐kernel search
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data
- Efficient data structures for model-free data-driven computational mechanics
- Balanced compact clustering for efficient range queries in metric spaces
- Fast exact \(k\) nearest neighbors search using an orthogonal search tree
- scientific article; zbMATH DE number 2087833 (Why is no real title available?)
- scientific article; zbMATH DE number 7525447 (Why is no real title available?)
- The efficiency of using k-d trees for finding nearest neighbors in discrete space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140435)
