Random Projection Trees for Vector Quantization

DOI10.1109/TIT.2009.2021326MaRDI QIDQ4975927zbMATH OpenDBLPWikidataFDO

Authors Sanjoy Dasgupta, Yoav Freund

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.1390

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Sampling theory in information and communication theory (94A20)

Abstract: A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent dimension of the space in which the data happen to lie.

Cited in

(13)

• Complexity-constrained tree-structured vector quantizers
• Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering
• Soft clustering by convex electoral model
• A fast k-prototypes algorithm using partial distance computation
• Formation of similarity-reflecting binary vectors with random binary projections
• scientific article; zbMATH DE number 6982931 (Why is no real title available?)
• Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
• Sparse projection oblique randomer forests
• k-POD: A Method for k-Means Clustering of Missing Data
• On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods
• Clustering with few disks to minimize the sum of radii
• On connections between k-coloring and Euclidean k-means
• Recovery guarantees for exemplar-based clustering

This page was built for publication: Random Projection Trees for Vector Quantization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975927)