Least squares quantization in PCM
From MaRDI portal
Publication:4740474
DOI10.1109/TIT.1982.1056489zbMATH Open0504.94015WikidataQ55881521 ScholiaQ55881521MaRDI QIDQ4740474FDOQ4740474
Authors: Stuart P. Lloyd
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Communication theory (94A05) Information theory (general) (94A15) Modulation and demodulation in information and communication theory (94A14)
Cited In (only showing first 100 items - show all)
- Hardness of \(k\)-anonymous microaggregation
- Efficient micromechanical analysis of fiber-reinforced composites subjected to cyclic loading through time homogenization and reduced-order modeling
- An efficient \(K\)-means clustering algorithm for tall data
- FEM-cluster based reduction method for efficient numerical prediction of effective properties of heterogeneous material in nonlinear range
- An isotropic unstructured mesh generation method based on a fluid relaxation analogy
- On the mathematical foundations of the self-consistent clustering analysis for non-linear materials at small strains
- An adaptive domain-based POD/ECM hyper-reduced modeling framework without offline training
- The seeding algorithms for spherical \(k\)-means clustering
- Clustering with missing features: a penalized dissimilarity measure based approach
- On the positive semi-definite property of similarity matrices
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- Support points
- Data-based derivation of material response
- Stochastic short-term hydropower planning with inflow scenario trees
- A distributed solution to the network reconstruction problem
- Delaunay meshing of implicit domains with boundary edge sharpening and sliver elimination
- Higher order mobile coverage control with applications to clustering of discrete sets
- Detecting cooperative and organized spammer groups in micro-blogging community
- Graph summarization with quality guarantees
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
- Joint optimization of an autoencoder for clustering and embedding
- Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach
- Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis
- Multi-stage resource-aware scheduling for data centers with heterogeneous servers
- A Bayesian mixture model for clustering circular data
- Consistently fitting orthopedic casts
- Surface reconstruction by parallel and unified particle-based resampling from point clouds
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- Fuzzy clustering using the convex hull as geometrical model
- Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
- Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
- Constructing Centroidal Voronoi Tessellations on Surface Meshes
- A weighted \(k\)-modes clustering using new weighting method based on within-cluster and between-cluster impurity measures
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- Greedy vector quantization
- Simplicial variances, potentials and Mahalanobis distances
- Nuclei segmentation for computer-aided diagnosis of breast cancer
- Fuzzy Concepts in Vector Quantization Training
- Geometric self-assembly of rigid shapes: a simple Voronoi approach
- Simplification and hierarchical representations of mixtures of exponential families
- Implementing Persistence-Based Clustering of Point Clouds in the Topology ToolKit
- On The Characterization and Uniqueness of Centroidal Voronoi Tessellations
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Clustering with or without the approximation
- Approximation algorithms for fuzzy \(C\)-means problem based on seeding method
- Learning pharmacokinetic models for in vivo glucocorticoid activation
- Properties of the sample estimators used for statistical normalization of feature vectors
- A distributed economic MPC framework for cooperative control under conflicting objectives
- Particle Gaussian mixture filters. I.
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Parallel domain decomposition strategies for stochastic elliptic equations. Part A: Local Karhunen-Loève representations
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations
- Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering
- An improved Bregman \(k\)-means++ algorithm via local search
- The spherical \(k\)-means++ algorithm via local search
- Quantization and compressive sensing
- Improved local search algorithms for Bregman \(k\)-means and its variants
- The spherical \(k\)-means++ algorithm via local search scheme
- A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage
- Quantum driven machine learning
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes
- Title not available (Why is that?)
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- A Simple Stochastic Rate Model for Rate Equity Hybrid Products
- Local search approximation algorithms for the \(k\)-means problem with penalties
- Convex programming based spectral clustering
- The vehicle routing problem with heterogeneous locker boxes
- Optimal dual quantizers of \(1 D\log \)-concave distributions: uniqueness and Lloyd like algorithm
- A streaming algorithm for \(k\)-means with approximate coreset
- A finite element framework based on bivariate simplex splines on triangle configurations
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Clustering of measures via mean measure quantization
- Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios
- Fitting tractable convex sets to support function evaluations
- BinaryRelax: a relaxation approach for training deep neural networks with quantized weights
- Noisy, Greedy and Not so Greedy k-Means++
- Bayesian optimization with approximate set kernels
- Scenario generation by selection from historical data
- Optimality of spectral clustering in the Gaussian mixture model
- Scenario reduction revisited: fundamental limits and guarantees
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- Bonsai: diverse and shallow trees for extreme multi-label classification
- Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data
- An efficient PODI method for real-time simulation of indenter contact problems using RBF interpolation and contact domain decomposition
- Blended coarse gradient descent for full quantization of deep neural networks
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- Unsupervised classification of children's bodies using currents
- BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
- Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
- Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes
- Loss aware post-training quantization
- Simplicial and minimal-variance distances in multivariate data analysis
- The approximation algorithm based on seeding method for functional \(k\)-means problem
This page was built for publication: Least squares quantization in PCM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740474)