scientific article; zbMATH DE number 5485566
From MaRDI portal
Publication:5302077
zbMath1231.68114MaRDI QIDQ5302077
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Gaussian random projections for Euclidean membership problems ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Unnamed Item ⋮ Intrinsic Dimension Adaptive Partitioning for Kernel Methods ⋮ QuickDSC: clustering by quick density subgraph estimation ⋮ Compressed labeling on distilled labelsets for multi-label learning ⋮ A tree-based regressor that adapts to intrinsic dimension ⋮ Scalable density-based clustering with quality guarantees using random projections ⋮ Testing the manifold hypothesis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Index structures for fast similarity search for real vectors. II ⋮ Approximating snowflake metrics by trees ⋮ Differentially-private learning of low dimensional manifolds ⋮ Linear-time CUR approximation of BEM matrices ⋮ A distributed kernel summation framework for general‐dimension machine learning ⋮ Dual‐tree fast exact max‐kernel search ⋮ No-collision transportation maps ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations ⋮ Conditional sum-product networks: modular probabilistic circuits via gate functions ⋮ Adaptive learning rates for support vector machines working on data with low intrinsic dimension ⋮ Minimax adaptive estimation in manifold inference ⋮ Anomaly detection: a functional analysis perspective ⋮ ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions ⋮ Randomized partition trees for nearest neighbor search
This page was built for publication:
