scientific article
From MaRDI portal
Publication:3140435
zbMath0801.68037MaRDI QIDQ3140435
Publication date: 15 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pattern recognitionclusteringmetric spaceassociative memorycomputational geometrynearest neighborrandomized methods
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (33)
Fusing vantage point trees and linear discriminants for fast feature classification ⋮ Detecting phase transitions in collective behavior using manifold's curvature ⋮ Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths ⋮ An indexing-based approach to pattern and video clip recognition ⋮ Guidelines for RBF-FD discretization: numerical experiments on the interplay of a multitude of parameter choices ⋮ A scalable re-ranking method for content-based image retrieval ⋮ Fast neighbor search by using revised \(k\)-d tree ⋮ Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions ⋮ Multilabel classification with meta-level features in a learning-to-rank framework ⋮ Distance-based index structures for fast similarity search ⋮ A parallel computing framework for big data ⋮ Pivot selection: dimension reduction for distance-based indexing ⋮ Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space ⋮ Balanced compact clustering for efficient range queries in metric spaces ⋮ Space-Time Tradeoffs for Proximity Searching in Doubling Spaces ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data ⋮ Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective ⋮ Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances ⋮ Unnamed Item ⋮ Efficient image retrieval through vantage objects ⋮ Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers ⋮ ForestDSH: a universal hash design for discrete probability distributions ⋮ Generalised kernel weighted fuzzy c-means clustering algorithm with local information ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Parallel query processing on distributed clustering indexes ⋮ Solving similarity joins and range queries in metric spaces with the list of twin clusters ⋮ Counting distance permutations ⋮ A distributed kernel summation framework for general‐dimension machine learning ⋮ Dual‐tree fast exact max‐kernel search ⋮ Probabilistic analysis of vantage point trees ⋮ Exploiting distance coherence to speed up range queries in metric indexes ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees
This page was built for publication:
