Finding the principal points of a random variable
From MaRDI portal
Recommendations
- Principal points
- Some characterizations of symmetric two-principal points
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
- Optimal estimators of principal points for minimizing expected mean squared distance
- Principal points and self-consistent points of elliptical distributions
Cites work
- An algorithm for nonconvex programming problems
- An asymptotic result on principal points for univariate distributions
- scientific article; zbMATH DE number 3113174 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- Least squares quantization in PCM
- On uniqueness and symmetry of self-consistent points of univariate continuous distributions
- Principal points
- Principal points and self-consistent points of elliptical distributions
- Principal points and self-consistent points of symmetric multivariate distributions
- Probabilistic models of computer systems. I: Exact results
- Two principal points of symmetric, strongly unimodal distributions
- Uniqueness of principal points for univariate distributions
Cited in
(6)- High precision numerical computation of principal points for univariate distributions
- Uniqueness of principal points with respect to \(p\)-order distance for a class of univariate continuous distribution
- scientific article; zbMATH DE number 1340527 (Why is no real title available?)
- Principal points analysis via p-median problem for binary data
- L^2-centroids and polynomial-based approximations
- Optimal estimators of principal points for minimizing expected mean squared distance
This page was built for publication: Finding the principal points of a random variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531457)
