Least squares quantization in PCM
From MaRDI portal
Publication:4740474
Cited in
(only showing first 100 items - show all)- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
- Data stability in clustering: a closer look
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Self-consistency: A fundamental concept in statistics
- Microstructural material database for self-consistent clustering analysis of elastoplastic strain softening materials
- A critical comparison of Lagrangian methods for coherent structure detection
- A survey on Mesh Segmentation Techniques
- Vector quantization and clustering in the presence of censoring
- A spatial regularization approach for vector quantization
- Clustering construction on a multimodal probability model
- Weighted ultrafast diffusion equations: from well-posedness to long-time behaviour
- Strong consistency of \(k\)-parameters clustering
- Four encounters with system identification
- Stabilization with data-rate-limited feedback: tightest attainable bounds
- Clustering with the average silhouette width
- Generalized \(k\)-means in GLMs with applications to the outbreak of COVID-19 in the United States
- Fast generation of 2-D node distributions for mesh-free PDE discretizations
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- Local search yields a PTAS for \(k\)-means in doubling metrics
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- Boundary feedback control of the Burgers equations by a reduced-order approach using centroidal Voronoi tessellations
- Optimal Bayesian experimental design for electrical impedance tomography in medical imaging
- Optimized, direct sale of privacy in personal data marketplaces
- A \(k\)-points-based distance for robust geometric inference
- A swarm-based approach to dynamic coverage control of multi-agent systems
- Robust Bregman clustering
- Deployment algorithms for a power-constrained mobile sensor network
- Quantisation scale-spaces
- Asymptotics of optimal quantizers for some scalar distributions
- Tracking people across disjoint camera views by an illumination-tolerant appearance representation
- Recent progress in robust and quality Delaunay mesh generation
- Convergence of the \(k\)-means minimization problem using \(\Gamma\)-convergence
- Learning causal networks via additive faithfulness
- Stability of equilibria in multi-party political systems
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- High order accurate conservative remapping scheme on polygonal meshes using \textit{a posteriori} MOOD limiting
- Building the library of RNA 3D nucleotide conformations using the clustering approach
- A local search approximation algorithm for \(k\)-means clustering
- Power particles: an incompressible fluid solver based on power diagrams
- Pointwise convergence of the Lloyd I algorithm in higher dimension
- Modelling pipeline for subject-specific arterial blood flow - a review
- Image compression by vector quantization of muliresolution decompositions
- The stochastic grid bundling method: efficient pricing of Bermudan options and their Greeks
- \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
- Asymptotic optimality of scalar Gersho quantizers
- Phase-Amplitude Separation and Modeling of Spherical Trajectories
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Min-max optimal data encoding and fusion in sensor networks
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- An efficient sensor quantization algorithm for decentralized estimation fusion
- A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- Blending spline surfaces over polygon mesh and their application to isogeometric analysis
- A multiscale analysis of multi-agent coverage control algorithms
- A refined approximation for Euclidean \(k\)-means
- RESAMPLING FOR FUZZY CLUSTERING
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data
- Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
- Parameterized \(k\)-clustering: tractability island
- Improved and simplified inapproximability for \(k\)-means
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Data science applications to string theory
- Derivative of an integral over a convex polytope
- Self-consistent clustering analysis: an efficient multi-scale scheme for inelastic heterogeneous materials
- Clustering in block Markov chains
- A versatile technique for the optimal approximation of random processes by functional quantization
- 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
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)