Probabilistic clustering of high dimensional norms

DOI10.1137/1.9781611974782.44MaRDI QIDQ4575781zbMATH OpenOpenAlexFDO

Authors Assaf Naor

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.44

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Metric spaces, metrizability (54E35) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Advances in metric embedding theory
• Extending Lipschitz functions via random metric partitions
• Bourgain's discretization theorem
• Advances in metric embedding theory
• On Lipschitz embedding of finite metric spaces in Hilbert space

Cited in

(8)

• Clustering of high values in random fields
• Regularized k-means clustering of high-dimensional data and its asymptotic consistency
• Impossibility of almost extension
• Absolute Lipschitz extendability and linear projection constants
• Optimal (Euclidean) Metric Compression
• The one-way communication complexity of dynamic time warping distance
• A probabilistic clustering method for data elements with normal distributed attributes
• Lipschitz decompositions of finite _p metrics

This page was built for publication: Probabilistic clustering of high dimensional norms

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