Clustering-based low rank approximation method
From MaRDI portal
Cites work
- Advances in studies and applications of centroidal Voronoi tessellations
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Cluster validation for mixtures of regressions via the total sum of squares decomposition
- Clustering with Bregman divergences.
- Concept decompositions for large sparse text data using clustering
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- Curvelet based face recognition via dimension reduction
- Generalized low rank approximations of matrices
- scientific article; zbMATH DE number 54145 (Why is no real title available?)
- scientific article; zbMATH DE number 2065597 (Why is no real title available?)
- scientific article; zbMATH DE number 1737519 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Least squares quantization in PCM
- Low rank approximation method for perturbed linear systems with applications to elliptic type stochastic PDEs
- Navier-Stokes equations for incompressible flows: finite element methods.
- Numerical studies of MacQueen's k-means algorithm for computing the centroidal Voronoi tessellations
- Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
- The approximation of one matrix by another of lower rank.
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- The singular value decomposition: Its computation and some applications
- Using Linear Algebra for Intelligent Information Retrieval
This page was built for publication: Clustering-based low rank approximation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314729)
