scientific article; zbMATH DE number 1559575

zbMath0963.68049MaRDI QIDQ4527027

Jon M. Kleinberg

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items

Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance ⋮ A strong lower bound for approximate nearest neighbor searching ⋮ The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite ⋮ An algorithmic theory of learning: robust concepts and random projection ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Database-friendly random projections: Johnson-Lindenstrauss with binary coins. ⋮ Decomposable algorithms for nearest neighbor computing ⋮ Multilabel classification with meta-level features in a learning-to-rank framework ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Approximate range searching in higher dimension ⋮ Why locality sensitive hashing works: a practical perspective ⋮ Probably correct \(k\)-nearest neighbor search in high dimensions ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Block classical Gram–Schmidt-based block updating in low-rank matrix approximation ⋮ Maximal intersection queries in randomized input models ⋮ An algorithmic theory of learning: Robust concepts and random projection ⋮ Efficient image retrieval through vantage objects ⋮ Nearest neighbour group-based classification ⋮ Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Cell-probe lower bounds for the partial match problem ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ Bayesian random projection-based signal detection for Gaussian scale space random fields ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ On computing the diameter of a point set in high dimensional Euclidean space. ⋮ Randomized partition trees for nearest neighbor search