Least squares quantization in PCM
From MaRDI portal
Publication:4740474
Cited in
(only showing first 100 items - show all)- 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
- Kernel-based adaptive sampling for image reconstruction and meshing
- Mathematical programming formulations and algorithms for discrete \(k\)-median clustering of time-series data
- Evolutionary radial basis functions for credit assessment
- Evolutionary radial basis functions for credit assessment
- Semi-automatic surface and volume mesh generation for subject-specific biomedical geometries
- Nonlinearities and adaptation of color vision from sequential principal curves analysis
- A new multi-resolution parallel framework for SPH
- Optimal stratification and clustering on the line using the \(L_ 1\)- norm
- Optimizing cluster structures with inner product induced norm based dissimilarity measures: theoretical development and convergence analysis
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- Music and timbre segmentation by recursive constrained \(K\)-means clustering
- scientific article; zbMATH DE number 7561533 (Why is no real title available?)
- A new hybrid adaptive mesh algorithm based on Voronoi tessellations and equi-distribution principle: algorithms and numerical experiments
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- Information-theoretic feature selection with discrete \(k\)-median clustering
- On the quality of \(k\)-means clustering based on grouped data
- Sparse probabilistic K-means
- A novel density peaks clustering algorithm based on \(k\) nearest neighbors for improving assignment process
- Redistricting algorithms
- Properties and generation of representative points of the exponential distribution
- Quadratic serendipity element shape functions on general planar polygons
- TCB-spline-based isogeometric analysis method with high-quality parameterizations
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
- Fast indefinite multi-point (IMP) clustering
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- Model assisted variable clustering: minimax-optimal recovery and algorithms
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Iterative algorithm for discrete structure recovery
- Seasonal warranty prediction based on recurrent event data
- A general SPH framework for transient seepage flows through unsaturated porous media considering anisotropic diffusion
- Reduced multidimensional scaling
- A user study on hybrid graph visualizations
- Nonlinear pricing with finite information
- Stratified mobility fishery models with harvesting outside of no-take areas
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- Quasi-stationary states in temporal correlations for traffic systems: Cologne orbital motorway as an example
- Generalized non-autonomous metric optimization for area coverage problems with mobile autonomous agents
- Multi-robots Gaussian estimation and coverage control: from client-server to peer-to-peer architectures
- Efficient dynamic hedging for large variable annuity portfolios with multiple underlying assets
- Structural variability from noisy tomographic projections
- An efficient approach in rainfall prediction around Sathanur dam, India, by model based clustering, structural equation modelling (SEM) and artificial neural networks (ANN)
- Frequency and severity estimation of cyber attacks using spatial clustering analysis
- Non-convex clustering via proximal alternating linearized minimization method
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- The blockwise coordinate descent method for integer programs
- A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions
- Probabilistic Verification of Neural Networks Against Group Fairness
- Generalizing the prediction sum of squares statistic and formula, application to linear fractional image warp and surface fitting
- A performance guarantee for spectral clustering
- Semi-supervised k-means++
- Approximating spectral clustering via sampling: a review
- GPU-based supervoxel segmentation for 3D point clouds
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)