Least squares quantization in PCM
From MaRDI portal
Publication:4740474
Cited in
(only showing first 100 items - show all)- Modelling pipeline for subject-specific arterial blood flow - a review
- Recovery guarantees for exemplar-based clustering
- Strong consistency of \(k\)-parameters clustering
- Limiting behavior of the gap between the largest two representative points of statistical distributions
- Data science applications to string theory
- Parallel domain decomposition strategies for stochastic elliptic equations. Part A: Local Karhunen-Loève representations
- On the strengths of the self-updating process clustering algorithm
- Robust Bregman clustering
- Quantisation scale-spaces
- Coarse-grid selection using simulated annealing
- Tree approximation for discrete time stochastic processes: a process distance approach
- Hardness of \(k\)-anonymous microaggregation
- Efficient micromechanical analysis of fiber-reinforced composites subjected to cyclic loading through time homogenization and reduced-order modeling
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- 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
- A general SPH framework for transient seepage flows through unsaturated porous media considering anisotropic diffusion
- On high-resolution adaptive sampling of deterministic signals
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
- A framework to uncover multiple alternative clusterings
- Optimal stratification and clustering on the line using the \(L_ 1\)- norm
- Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers
- Abductive reasoning in 2D geospatial problems
- Smoothed particle hydrodynamics with stress points and centroid Voronoi tessellation (cvt) topology optimization
- Data-driven solvers for strongly nonlinear material response
- Cluster based nonuniform transformation field analysis: an efficient homogenization for inelastic heterogeneous materials
- Automatic and efficient hybrid viscous mesh generation based on clipped Voronoi diagrams
- Exploration of efficient reduced-order modeling and a posteriori error estimation
- A virtual multi-label approach to imbalanced data classification
- A multilevel tabu search algorithm for balanced partitioning of unstructured grids
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Clustering of functional data in a low-dimensional subspace
- Plume or bubble? Mixed-convection flow regimes and city-scale circulations
- Image compression by vector quantization of muliresolution decompositions
- Clustering with missing features: a penalized dissimilarity measure based approach
- 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
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Mathematical optimization in intensity modulated radiation therapy
- The seeding algorithms for spherical \(k\)-means clustering
- Derivative of an integral over a convex polytope
- Modifications of the two-stage transportation problem and their applications
- Temporal clustering
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- A generalized Weisfeiler-Lehman graph kernel
- Prescriptive selection of machine learning hyperparameters with applications in power markets: retailer's optimal trading
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- Network measures of mixing
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means
- Clustering with the average silhouette width
- Generalized k-means in GLMs with applications to the outbreak of COVID-19 in the United States
- Reduction of multivariate mixtures and its applications
- \(k\)-means genetic algorithms with greedy genetic operators
- Cluster analysis using multivariate normal mixture models to detect differential gene expression with microarray data
- Design of functionally graded piezocomposites using topology optimization and homogenization -- toward effective energy harvesting materials
- Timely decision analysis enabled by efficient social media modeling
- Upstream actuation for bluff-body wake control driven by a genetically inspired optimization
- Support points
- KmL: k-means for longitudinal data
- Graph clustering with Boltzmann machines
- Tracking people across disjoint camera views by an illumination-tolerant appearance representation
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- Coresets for Fuzzy K-Means with Applications
- Unsupervised learning for medical data: a review of probabilistic factorization methods
- Flexible regularized estimation in high-dimensional mixed membership models
- Factor selection in screening experiments by aggregation over random models
- Anomaly detection in the probability simplex under different geometries
- Human-swarm collaboration with coverage control under nonidentical and limited sensory ranges
- On identification of FIR systems having quantized output data
- Dense Glyph Sampling for Visualization
- Stochastic short-term hydropower planning with inflow scenario trees
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
- Data-based derivation of material response
- Fast methods for computing centroidal Voronoi tessellations
- Limit theorems for random normalized distortion
- Stratified mobility fishery models with harvesting outside of no-take areas
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- Delta Voronoi smoothed particle hydrodynamics, \(\delta\)-VSPH
- An approximation algorithm based on seeding algorithm for fuzzy \(k\)-means problem with penalties
- Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties
- Matrix-variate normal mean-variance Birnbaum-Saunders distributions and related mixture models
- Skeleton Clustering: Dimension-Free Density-Aided Clustering
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Generalized non-autonomous metric optimization for area coverage problems with mobile autonomous agents
- On the quality of k-means clustering based on grouped data
- Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
- A general framework for efficient clustering of large datasets based on activity detection
- An efficient k‐means‐type algorithm for clustering datasets with incomplete records
- A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations
- A distributed solution to the network reconstruction problem
- Delaunay meshing of implicit domains with boundary edge sharpening and sliver elimination
- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
- A posteriori error control for the binary Mumford-Shah model
- A clustering-enhanced potential-based reduced order homogenization framework for nonlinear heterogeneous materials
- Biconvex Clustering
- Typed topology and its application to data sets
- Discrete facility location in machine learning
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)