Least squares quantization in PCM
From MaRDI portal
Publication:4740474
Cited in
(only showing first 100 items - show all)- 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
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Cross-entropy clustering
- Limit theorems for random normalized distortion
- Projection-based curve clustering
- A survey of data mining techniques applied to agriculture
- Discrete optimal transport: complexity, geometry and applications
- Tree approximation for discrete time stochastic processes: a process distance approach
- Automatic segmentation of blood vessels from retinal fundus images through image processing and data mining techniques
- Mathematical optimization in intensity modulated radiation therapy
- Cluster-based reduced-order modelling of a mixing layer
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- Dirichlet-tree multinomial mixtures for clustering microbiome compositions
- Phase-field based topology optimization with polygonal elements: a finite volume approach for the evolution equation
- Mesh sensitivity in peridynamic simulations
- Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems
- Centroidal Voronoi tessellation-based finite element superconvergence
- Finding archetypal patterns for binary questionnaires
- Mixture models of categorization
- Beam selection in radiotherapy design
- Mathematical optimization in intensity modulated radiation therapy
- Functional factorial \(K\)-means analysis
- Adaptive fusion of color and spatial features for noise-robust retrieval of colored logo and trademark images
- Identifiability of nonparametric mixture models and Bayes optimal clustering
- A minimal surface criterion for graph partitioning
- Design of functionally graded piezocomposites using topology optimization and homogenization -- toward effective energy harvesting materials
- Self-consistent field theory simulations of polymers on arbitrary domains
- A family of unsupervised sampling algorithms
- On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Adaptive \(h\)-refinement for reduced-order models
- Hierarchical Community Detection by Recursive Partitioning
- Recovery guarantees for exemplar-based clustering
- 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
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)