Publication:3140435
From MaRDI portal
zbMath0801.68037MaRDI QIDQ3140435
Publication date: 15 December 1993
pattern recognition; clustering; metric space; associative memory; computational geometry; nearest neighbor; randomized methods
68T10: Pattern recognition, speech recognition
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Unnamed Item, A distributed kernel summation framework for general‐dimension machine learning, Dual‐tree fast exact max‐kernel search, Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers, Efficient image retrieval through vantage objects, A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee, Accelerating Fourier–Motzkin elimination using bit pattern trees, Guidelines for RBF-FD discretization: numerical experiments on the interplay of a multitude of parameter choices, Detecting phase transitions in collective behavior using manifold's curvature, Multilabel classification with meta-level features in a learning-to-rank framework, Pivot selection: dimension reduction for distance-based indexing, An indexing-based approach to pattern and video clip recognition, A scalable re-ranking method for content-based image retrieval, 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, Exploiting distance coherence to speed up range queries in metric indexes, Distance-based index structures for fast similarity search, A parallel computing framework for big data, Generalised kernel weighted fuzzy c-means clustering algorithm with local information, Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions, Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space, 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, ForestDSH: a universal hash design for discrete probability distributions, Probabilistic analysis of vantage point trees, Fast neighbor search by using revised \(k\)-d tree, 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, Fusing vantage point trees and linear discriminants for fast feature classification, Balanced compact clustering for efficient range queries in metric spaces, Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths, Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
