The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity

DOI10.1080/03610926.2013.781645zbMath1328.62394OpenAlexW2054100135MaRDI QIDQ3462365

Haruka Yamashita, Hideo Suzuki

Publication date: 5 January 2016

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2013.781645

zbMATH Keywords

clusteringdata analysismultivariate binary distributionuncapacitated location problem

Mathematics Subject Classification ID

Related Items (2)

Principal points analysis via p-median problem for binary data ⋮ High precision numerical computation of principal points for univariate distributions

Cites Work

• Unnamed Item
• Principal points of a multivariate mixture distribution
• Submodular function minimization
• A note on solving large p-median problems
• On uniqueness and symmetry of self-consistent points of univariate continuous distributions
• An efficient genetic algorithm for the \(p\)-median problem
• Principal points and self-consistent points of elliptical distributions
• Solving the simple plant location problem by genetic algorithm
• Principal points
• Technical Note—An Algorithm for the p-Median Problem
• An analysis of approximations for maximizing submodular set functions—I
• A note on the quadratic exponential binary distribution
• TWO PRINCIPAL POINTS FOR MULTIVARIATE LOCATION MIXTURES OF SPHERICALLY SYMMETRIC DISTRIBUTIONS
• Estimation of Principal Points
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

This page was built for publication: The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity