Least squares quantization in PCM
From MaRDI portal
Publication:4740474
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
- 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
- Probably certifiably correct \(k\)-means clustering
- Embedding graphs on Grassmann manifold
- Optimizing Weighted Ensemble Sampling of Steady States
- Image‐Based Surface Compression
- The \(k\)-means algorithm for 3D shapes with an application to apparel design
- Variational shape approximation of point set surfaces
- Clustering High-Dimensional Data via Feature Selection
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)