Random Projection Trees for Vector Quantization

DOI10.1109/TIT.2009.2021326zbMath1368.68223DBLPjournals/tit/DasguptaF09arXiv0805.1390WikidataQ56674902 ScholiaQ56674902MaRDI QIDQ4975927

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

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

Related Items (8)

k-POD: A Method for k-Means Clustering of Missing Data ⋮ Soft clustering by convex electoral model ⋮ Unnamed Item ⋮ Recovery guarantees for exemplar-based clustering ⋮ Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering ⋮ Unnamed Item ⋮ A fast k-prototypes algorithm using partial distance computation ⋮ Unnamed Item

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