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
- A weighted k-modes clustering using new weighting method based on within-cluster and between-cluster impurity measures
- 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
- Parallel Domain Decomposition Strategies for Stochastic Elliptic Equations. Part A: Local Karhunen--Loève Representations
- 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
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- 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
- 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
- Mathematical optimization in intensity modulated radiation therapy
- Tree approximation for discrete time stochastic processes: a process distance approach
- Clustering of functional data in a low-dimensional subspace
- Modifications of the two-stage transportation problem and their applications
- Design of functionally graded piezocomposites using topology optimization and homogenization -- toward effective energy harvesting materials
- KmL: k-means for longitudinal data
- Fast methods for computing centroidal Voronoi tessellations
- On identification of FIR systems having quantized output data
- Limit theorems for random normalized distortion
- Topology optimization using polytopes
- Learning a multi-dimensional companding function for lossy source coding
- Dirichlet-tree multinomial mixtures for clustering microbiome compositions
- Functional factorial \(K\)-means analysis
- Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
- A bad instance for \texttt{k-means++}
- Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search
- An extension of multiple correspondence analysis for identifying heterogeneous subgroups of respondents
- The planar \(k\)-means problem is NP-hard
- Identifiability of nonparametric mixture models and Bayes optimal clustering
- A Family of Unsupervised Sampling Algorithms
- Projection-based curve clustering
- Comparing clusterings -- an information based distance
- On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences
- \(k\)-means requires exponentially many iterations even in the plane
- Simultaneous Registration and Clustering for Multidimensional Functional Data
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- Automatic segmentation of blood vessels from retinal fundus images through image processing and data mining techniques
- The Planar k-Means Problem is NP-Hard
- Centroidal Voronoi tessellation in universal covering space of manifold surfaces
- Mixture models of categorization
- Dimension-reduced clustering of functional data via subspace separation
- Mesh sensitivity in peridynamic simulations
- Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems
- Uncovering the dynamics of correlation structures relative to the collective market motion
- Recursive algorithms for parameter estimation with adaptive quantizer
- Adaptiveh-refinement for reduced-order models
- Polygonal finite elements for topology optimization: a unifying paradigm
- Gas storage valuation applying numerically constructed recombining trees
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
- Minimax and Minimax Projection Designs Using Clustering
- A semiparametric method for clustering mixed data
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Centroidal Voronoi tessellation-based finite element superconvergence
- Adaptive fusion of color and spatial features for noise-robust retrieval of colored logo and trademark images
- A minimal surface criterion for graph partitioning
- Cross-entropy clustering
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)