Least squares quantization in PCM
From MaRDI portal
Publication:4740474
Cited in
(only showing first 100 items - show all)- The spherical \(k\)-means++ algorithm via local search
- Noisy, Greedy and Not so Greedy k-Means++
- Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- An efficient PODI method for real-time simulation of indenter contact problems using RBF interpolation and contact domain decomposition
- A streaming algorithm for \(k\)-means with approximate coreset
- Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials
- The correlation between statistical descriptors of heterogeneous materials
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Clustering of measures via mean measure quantization
- Quantization and compressive sensing
- A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations
- The vehicle routing problem with heterogeneous locker boxes
- BinaryRelax: a relaxation approach for training deep neural networks with quantized weights
- Optimal dual quantizers of \(1 D\log \)-concave distributions: uniqueness and Lloyd like algorithm
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
- Dissecting graph measure performance for node clustering in LFR parameter space
- Approximation algorithm for spherical \(k\)-means problem with penalty
- Multimodal correlations-based data clustering
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- Simulation of crumpled sheets via alternating quasistatic and dynamic representations
- Bayesian optimization with approximate set kernels
- Scenario generation by selection from historical data
- Local search approximation algorithms for the \(k\)-means problem with penalties
- Optimality of spectral clustering in the Gaussian mixture model
- High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes
- Surrogate parametric metamodel based on optimal transport
- Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios
- Improved local search algorithms for Bregman \(k\)-means and its variants
- The spherical \(k\)-means++ algorithm via local search scheme
- An approximation algorithm for the uniform capacitated \(k\)-means problem
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem
- A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage
- A finite element framework based on bivariate simplex splines on triangle configurations
- Quantum driven machine learning
- Unsupervised classification of children's bodies using currents
- Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
- A frontal Delaunay quad mesh generator using the \(L^{\infty}\) norm
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Convex programming based spectral clustering
- Supervised distance metric learning through maximization of the Jeffrey divergence
- Blended coarse gradient descent for full quantization of deep neural networks
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- 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
- 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
- Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering
- An improved Bregman \(k\)-means++ algorithm via local search
- 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
- scientific article; zbMATH DE number 7378621 (Why is no real title available?)
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
- A Simple Stochastic Rate Model for Rate Equity Hybrid Products
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Scenario reduction revisited: fundamental limits and guarantees
- Fitting tractable convex sets to support function evaluations
- Enhanced step-wise approximation to speech file in a noisy environment
- An \({\ell_p}\) theory of PCA and spectral clustering
- Sharp optimal recovery in the two component Gaussian mixture model
- NetWorkSpace: A coordination system for high-productivity environments
- Experiments with a non-convex variance-based clustering criterion
- An Introduction to Neural Data Compression
- Parallelizing MCMC sampling via space partitioning
- The seeding algorithm for \(k\)-means problem with penalties
- Comparison of internal clustering validation indices for prototype-based clustering
- Statistical properties of convex clustering
- Octree encoding of objects from range images
- Cluster analysis using multivariate normal mixture models to detect differential gene expression with microarray data
- An LP-based \(k\)-means algorithm for balancing weighted point sets
- Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective
- The Kohonen self-organizing map method: An assessment
- On the minimum of the mean-squared error in 2-means clustering
- Adaptive triangular mesh coarsening with centroidal Voronoi tessellations
- A new attempt to identify long-term precursors for endogenous financial crises in the market correlation structures
- Approximation Algorithms for Matroid and Knapsack Means Problems
- Stochastic backward Euler: an implicit gradient descent algorithm for \(k\)-means clustering
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
- Hybrid Voronoi mesh generation: algorithms and unsolved problems
- Nonparametric estimation of the regression function from quantized observations
- A bi-criteria analysis for fuzzy \(C\)-means problem
- Fractal dimension and vector quantization
- A framework to uncover multiple alternative clusterings
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Decentralized dynamic coverage control for mobile sensor networks in a non-convex environment
- Local versions of sum-of-norms clustering
- Global optimality in \(k\)-means clustering
- Hierarchical means clustering
- Quantization-based clustering algorithm
- Optimal Transport Approximation of 2-Dimensional Measures
- On the Complexity of Clustering with Relaxed Size Constraints
- A geometric approach to non-parametric density estimation
- PDE-based signal quantization
- A hybrid algorithm with cluster analysis in modelling high dimensional data
- A two-echelon joint continuous-discrete location model
- On neural network design. I: Using the MVQ algorithm
- Retrieval of textured images through the use of quantization and modal analysis
- A physics-motivated centroidal Voronoi particle domain decomposition method
- Functional data approximation on bounded domains using polygonal finite elements
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)