Least squares quantization in PCM

Cited in

(only showing first 100 items - show all)

Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
A weighted \(k\)-modes clustering using new weighting method based on within-cluster and between-cluster impurity measures
Fuzzy Concepts in Vector Quantization Training
Constructing Centroidal Voronoi Tessellations on Surface Meshes
Data-based derivation of material response
Implementing Persistence-Based Clustering of Point Clouds in the Topology ToolKit
Support points
Stochastic short-term hydropower planning with inflow scenario trees
Clustering with missing features: a penalized dissimilarity measure based approach
The seeding algorithms for spherical \(k\)-means clustering
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
Hardness of \(k\)-anonymous microaggregation
Clustering with or without the approximation
On The Characterization and Uniqueness of Centroidal Voronoi Tessellations
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
Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
Approximation algorithms for fuzzy \(C\)-means problem based on seeding method
\(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
The seeding algorithm for spherical \(k\)-means clustering with penalties
A comparison of four approaches from stochastic programming for large-scale unit-commitment
Learning pharmacokinetic models for in vivo glucocorticoid activation
When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
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.
Geometric self-assembly of rigid shapes: a simple Voronoi approach
Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
Parallel domain decomposition strategies for stochastic elliptic equations. Part A: Local Karhunen-Loève representations
Simplicial variances, potentials and Mahalanobis distances
Multi-stage resource-aware scheduling for data centers with heterogeneous servers
Simplification and hierarchical representations of mixtures of exponential families
Joint optimization of an autoencoder for clustering and embedding
Greedy vector quantization
Higher order mobile coverage control with applications to clustering of discrete sets
Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach
Detecting cooperative and organized spammer groups in micro-blogging community
Graph summarization with quality guarantees
A Bayesian mixture model for clustering circular data
Consistently fitting orthopedic casts
Surface reconstruction by parallel and unified particle-based resampling from point clouds
A distributed solution to the network reconstruction problem
Nuclei segmentation for computer-aided diagnosis of breast cancer
Fuzzy clustering using the convex hull as geometrical model
Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis
Delaunay meshing of implicit domains with boundary edge sharpening and sliver elimination
Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
Anisotropic mesh quality measures and adaptation for polygonal meshes
Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
Quantization and clustering with Bregman divergences
A survey of kernel and spectral methods for clustering
Meshfree, probabilistic determination of point sets and support regions for meshless computing
Hhsmm: An R package for hidden hybrid Markov/semi-Markov models
\(k\)-means requires exponentially many iterations even in the plane
The Planar k-Means Problem is NP-Hard
A bad instance for \texttt{k-means++}
Polygonal finite elements for topology optimization: a unifying paradigm
The finite cell method for polygonal meshes: poly-FCM
Direct reading algorithm for hierarchical clustering
KmL: k-means for longitudinal data
Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
Grid generation and optimization based on centroidal Voronoi tessellations
Learning a multi-dimensional companding function for lossy source coding
Deep mixtures of unigrams for uncovering topics in textual data
Comparing clusterings -- an information based distance
Clustering of functional data in a low-dimensional subspace
Topology optimization using polytopes
Recursive algorithms for parameter estimation with adaptive quantizer
A FAST k-MEANS IMPLEMENTATION USING CORESETS
CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
Fast methods for computing centroidal Voronoi tessellations
Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search
Quantile-based clustering
On identification of FIR systems having quantized output data
Clustering through continuous facility location problems
Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results
Generalized edge-weighted centroidal Voronoi tessellations for geometry processing
An extension of multiple correspondence analysis for identifying heterogeneous subgroups of respondents
Cluster-based fitting of phase-type distributions to empirical data
Simultaneous Registration and Clustering for Multidimensional Functional Data
Dimension-reduced clustering of functional data via subspace separation
Minimax and Minimax Projection Designs Using Clustering
Modifications of the two-stage transportation problem and their applications
Structure-sensitive superpixels via geodesic distance
The planar \(k\)-means problem is NP-hard
Gas storage valuation applying numerically constructed recombining trees
A linear optimal transportation framework for quantifying and visualizing variations in sets of images
A semiparametric method for clustering mixed data
Uncovering the dynamics of correlation structures relative to the collective market motion
Beyond good partition shapes: an analysis of diffusive graph partitioning
k-POD: A Method for k-Means Clustering of Missing Data
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Quantum speed-up for unsupervised learning

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)