Principal points analysis via p-median problem for binary data
From MaRDI portal
Publication:5037110
DOI10.1080/02664763.2019.1675605OpenAlexW2979546387MaRDI QIDQ5037110
Haruka Yamashita, Yoshinobu Kawahara
Publication date: 25 February 2022
Published in: Journal of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02664763.2019.1675605
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Principal points of a multivariate mixture distribution
- Principal points and elliptical distributions from the multivariate setting to the functional case
- On principal points for location mixtures of spherically symmetric distributions
- Principal point classification: applications to differentiating drug and placebo responses in longitudinal studies
- Two principal points of symmetric, strongly unimodal distributions
- An aggregation heuristic for large scale p-median problem
- Clustering functional data
- Principal points and self-consistent points of elliptical distributions
- On uniqueness of two principal points for univariate location mixtures
- Principal points
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
- Optimal Binning Strategies Under Squared Error Loss in Selective Assembly with a Tolerance Constraint
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Technical Note—An Algorithm for the p-Median Problem
- An analysis of approximations for maximizing submodular set functions—I
- Estimation of Principal Points